Metamath Proof Explorer


Theorem adh-minimp

Description: Another single axiom for minimal implicational calculus, due to Meredith. Other single axioms of the same length are known, but it is thought to be the minimal length. Among single axioms of this length, it is the one with simplest antecedents (i.e., in the corresponding ordering of binary trees which first compares left subtrees, it is the first one). Known as "HI-2" on Dolph Edward "Ted" Ulrich's web page. In the next 4 lemmas and 5 theorems, ax-1 and ax-2 are derived from this other single axiom in 20 detachments (instances of ax-mp ) in total. Polish prefix notation: CpCCqrCCCsqCrtCqt ; or CtCCpqCCCspCqrCpr in Carew Arthur Meredith and Arthur Norman Prior,Notes on the axiomatics of the propositional calculus, Notre Dame Journal of Formal Logic, volume IV, number 3, July 1963, pages 171--187, on page 180. (Contributed by BJ, 4-Apr-2021) (Revised by ADH, 10-Nov-2023)

Ref Expression
Assertion adh-minimp ( 𝜑 → ( ( 𝜓𝜒 ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓𝜏 ) ) ) )

Proof

Step Hyp Ref Expression
1 jarr ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓 → ( 𝜒𝜏 ) ) )
2 ax-2 ( ( 𝜓 → ( 𝜒𝜏 ) ) → ( ( 𝜓𝜒 ) → ( 𝜓𝜏 ) ) )
3 imim2 ( ( ( 𝜓 → ( 𝜒𝜏 ) ) → ( ( 𝜓𝜒 ) → ( 𝜓𝜏 ) ) ) → ( ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓 → ( 𝜒𝜏 ) ) ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( ( 𝜓𝜒 ) → ( 𝜓𝜏 ) ) ) ) )
4 2 3 ax-mp ( ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓 → ( 𝜒𝜏 ) ) ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( ( 𝜓𝜒 ) → ( 𝜓𝜏 ) ) ) )
5 1 4 ax-mp ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( ( 𝜓𝜒 ) → ( 𝜓𝜏 ) ) )
6 pm2.04 ( ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( ( 𝜓𝜒 ) → ( 𝜓𝜏 ) ) ) → ( ( 𝜓𝜒 ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓𝜏 ) ) ) )
7 5 6 ax-mp ( ( 𝜓𝜒 ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓𝜏 ) ) )
8 ax-1 ( ( ( 𝜓𝜒 ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓𝜏 ) ) ) → ( 𝜑 → ( ( 𝜓𝜒 ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓𝜏 ) ) ) ) )
9 7 8 ax-mp ( 𝜑 → ( ( 𝜓𝜒 ) → ( ( ( 𝜃𝜓 ) → ( 𝜒𝜏 ) ) → ( 𝜓𝜏 ) ) ) )