Theorem adh-minim-ax2-lem6 46954

Description: Sixth lemma for the derivation of ax-2 7 from adh-minim 46947 and ax-mp 5. Polish prefix notation: CCpCCCCqrsCCrCstCrtuCpu . (Contributed by ADH, 10-Nov-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
adh-minim-ax2-lem6	⊢ ((𝜑 → ((((𝜓 → 𝜒) → 𝜃) → ((𝜒 → (𝜃 → 𝜏)) → (𝜒 → 𝜏))) → 𝜂)) → (𝜑 → 𝜂))

Proof of Theorem adh-minim-ax2-lem6

Step	Hyp	Ref	Expression
1		adh-minim-ax2-lem5 46953	. 2 ⊢ ((𝜁 → 𝜑) → (((𝜓 → 𝜒) → 𝜃) → ((𝜒 → (𝜃 → 𝜏)) → (𝜒 → 𝜏))))
2		adh-minim-ax1-ax2-lem4 46951	. 2 ⊢ (((𝜁 → 𝜑) → (((𝜓 → 𝜒) → 𝜃) → ((𝜒 → (𝜃 → 𝜏)) → (𝜒 → 𝜏)))) → ((𝜑 → ((((𝜓 → 𝜒) → 𝜃) → ((𝜒 → (𝜃 → 𝜏)) → (𝜒 → 𝜏))) → 𝜂)) → (𝜑 → 𝜂)))
3	1, 2	ax-mp 5	1 ⊢ ((𝜑 → ((((𝜓 → 𝜒) → 𝜃) → ((𝜒 → (𝜃 → 𝜏)) → (𝜒 → 𝜏))) → 𝜂)) → (𝜑 → 𝜂))

Syntax hints:   → wi 4

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7

This theorem is referenced by:  adh-minim-ax2c  46955  adh-minim-ax2  46956