let ⟨C, ruleA⟩ := notSimpleToRuleApp not_simple
L R : Finset Formula
not_simple : ¬Simple (L, R)
⊢ ∃ Lcond Rcond ress x, Lcond ⊆ L ∧ Rcond ⊆ R
L R : Finset Formula
not_simple : ¬Simple (L, R)
C : List TNode
ruleA : LocalRuleApp (L, R) C
⊢ ∃ Lcond Rcond ress x, Lcond ⊆ L ∧ Rcond ⊆ R