Theorem: FOL.NV.T_18_7 (FOL/NV/Margaris/Fol.lean)

State before:
P_u P_v Q Q' : Formula
u v : VarName
Δ : Set Formula
h1 : IsDeduct Δ Q
h2 : IsReplOfFormulaInFormula (forall_ u P_u) (forall_ v P_v) Q Q'
h3 : Similar P_u P_v u v
⊢ IsDeduct Δ Q'
Tactic:
apply C_18_4 (forall_ u P_u) (forall_ v P_v) Q Q' Δ h2
State after:
case h2
P_u P_v Q Q' : Formula
u v : VarName
Δ : Set Formula
h1 : IsDeduct Δ Q
h2 : IsReplOfFormulaInFormula (forall_ u P_u) (forall_ v P_v) Q Q'
h3 : Similar P_u P_v u v
⊢ IsProof ((forall_ u P_u).iff_ (forall_ v P_v))

case h3
P_u P_v Q Q' : Formula
u v : VarName
Δ : Set Formula
h1 : IsDeduct Δ Q
h2 : IsReplOfFormulaInFormula (forall_ u P_u) (forall_ v P_v) Q Q'
h3 : Similar P_u P_v u v
⊢ IsDeduct Δ Q

State before:
case h2
P_u P_v Q Q' : Formula
u v : VarName
Δ : Set Formula
h1 : IsDeduct Δ Q
h2 : IsReplOfFormulaInFormula (forall_ u P_u) (forall_ v P_v) Q Q'
h3 : Similar P_u P_v u v
⊢ IsProof ((forall_ u P_u).iff_ (forall_ v P_v))
Tactic:
apply T_18_6 P_u P_v u v h3
State after:
no goals

State before:
case h3
P_u P_v Q Q' : Formula
u v : VarName
Δ : Set Formula
h1 : IsDeduct Δ Q
h2 : IsReplOfFormulaInFormula (forall_ u P_u) (forall_ v P_v) Q Q'
h3 : Similar P_u P_v u v
⊢ IsDeduct Δ Q
Tactic:
exact h1
State after:
no goals