wd_Logical_Op_Neg {
\find ( WD ( ! a ) )
\replacewith ( WD ( a ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 16 Offset :4wd_Logical_Op_Neg {
\find ( WD ( ! a ) )
\replacewith ( WD ( a ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 182 Offset :4wd_Logical_Op_ExCond_Expr {
\find ( wd ( \ifEx j ; ( a ) \then ( s ) \else ( t ) ) )
\varcond \replacewith ( ( \exists j ; ( WD ( a ) & wd ( s ) & a & ( ( wellOrderLeqInt ( jPrime , j ) & ( jPrime != j ) ) -> { \subst j ; jPrime } ( WD ( a ) & ! a ) ) ) ) | ( \forall j ; ( WD ( a ) & wd ( t ) & ! a ) ) | ( \forall j ; ( wd ( s ) & wd ( t ) & ( s = t ) ) ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 259 Offset :4wd_Logical_Op_ExCond_Form {
\find ( WD ( \ifEx j ; ( a ) \then ( b ) \else ( c ) ) )
\varcond \replacewith ( ( \exists j ; ( WD ( a ) & WD ( b ) & a & ( ( wellOrderLeqInt ( jPrime , j ) & ( jPrime != j ) ) -> { \subst j ; jPrime } ( WD ( a ) & ! a ) ) ) ) | ( \forall j ; ( WD ( a ) & WD ( c ) & ! a ) ) | ( \forall j ; ( WD ( b ) & WD ( c ) & ( b <-> c ) ) ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 278 Offset :4wd_T_Logical_Op_Neg {
\find ( T ( ! a ) )
\replacewith ( F ( a ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 322 Offset :4wd_F_Logical_Op_Neg {
\find ( F ( ! a ) )
\replacewith ( T ( a ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 333 Offset :4wd_Logical_Op_ExCond_Expr {
\find ( wd ( \ifEx j ; ( a ) \then ( s ) \else ( t ) ) )
\varcond \replacewith ( ( \exists j ; ( T ( a ) & wd ( s ) & ( ( wellOrderLeqInt ( jPrime , j ) & ( jPrime != j ) ) -> { \subst j ; jPrime } F ( a ) ) ) ) | ( \forall j ; ( F ( a ) & wd ( t ) ) ) | ( \forall j ; ( wd ( s ) & wd ( t ) & ( s = t ) ) ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 465 Offset :4wd_T_Logical_Op_ExCond_Form {
\find ( T ( \ifEx j ; ( a ) \then ( b ) \else ( c ) ) )
\varcond \replacewith ( ( \exists j ; ( T ( a ) & T ( b ) & ( ( wellOrderLeqInt ( jPrime , j ) & ( jPrime != j ) ) -> { \subst j ; jPrime } F ( a ) ) ) ) | ( \forall j ; ( F ( a ) & T ( c ) ) ) | ( \forall j ; ( T ( b ) & T ( c ) ) ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 484 Offset :4wd_F_Logical_Op_ExCond_Form {
\find ( F ( \ifEx j ; ( a ) \then ( b ) \else ( c ) ) )
\varcond \replacewith ( ( \exists j ; ( T ( a ) & F ( b ) & ( ( wellOrderLeqInt ( jPrime , j ) & ( jPrime != j ) ) -> { \subst j ; jPrime } F ( a ) ) ) ) | ( \forall j ; ( F ( a ) & F ( c ) ) ) | ( \forall j ; ( F ( b ) & F ( c ) ) ) )
\heuristics (simplify )
};defined in: wdFormulaRules.key Line: 503 Offset :4