have := notSimpleThenLocalRule hyp
case val.isSimple
LR : TNode
canApplyRule : ¬∃ Lcond Rcond C, Nonempty (LocalRule (Lcond, Rcond) C) ∧ Lcond ⊆ LR.1 ∧ Rcond ⊆ LR.2
hyp : ¬Simple LR
⊢ False
case val.isSimple
LR : TNode
canApplyRule : ¬∃ Lcond Rcond C, Nonempty (LocalRule (Lcond, Rcond) C) ∧ Lcond ⊆ LR.1 ∧ Rcond ⊆ LR.2
hyp : ¬Simple LR
this : ∃ Lcond Rcond ress x, Lcond ⊆ LR.1 ∧ Rcond ⊆ LR.2
⊢ False