Theorem dalloverimex-P7.CL 1035

Description: Closed Form of dalloverimex-P7 1033. †

Assertion

Ref	Expression
dalloverimex-P7.CL	⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∀𝑥𝜑 → (∃𝑥𝜓 → ∃𝑥𝜒)))

Proof of Theorem dalloverimex-P7.CL

Step	Hyp	Ref	Expression
1		rcp-NDASM1of1 192	. 2 ⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → ∀𝑥(𝜑 → (𝜓 → 𝜒)))
2	1	dalloverimex-P7 1033	1 ⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∀𝑥𝜑 → (∃𝑥𝜓 → ∃𝑥𝜒)))

Syntax hints:  ∀wff-forall 8   → wff-imp 10  ∃wff-exists 595

This theorem was proved from axioms:  ax-L1 11  ax-L2 12  ax-L3 13  ax-MP 14  ax-GEN 15  ax-L4 16  ax-L5 17  ax-L6 18  ax-L7 19  ax-L10 27  ax-L11 28  ax-L12 29

This theorem depends on definitions:  df-bi-D2.1 107  df-and-D2.2 133  df-or-D2.3 145  df-true-D2.4 155  df-rcp-AND3 161  df-exists-D5.1 596  df-nfree-D6.1 682  df-psub-D6.2 716

This theorem is referenced by: (None)