Theorem meredith 644

Description: Carew Meredith's sole axiom for propositional calculus. This amazing formula is thought to be the shortest possible single axiom for propositional calculus using negation, implication, and inference rule ax-mp 6. Here we prove Meredith's axiom from ax-1 3, ax-2 4, and ax-3 5. Then from it we derive the Lukasiewicz axioms luk-1 658, luk-2 659, and luk-3 660. Using these we finally re-derive our axioms as ax1 669, ax2 670, and ax3 671, thus proving the equivalence of all three systems. C. A. Meredith, "Single Axioms for the Systems (C,N), (C,O) and (A,N) of the Two-Valued Propositional Calculus", The Journal of Computing Systems vol. 3 (1953), pp. 155-164. Meredith claimed to be close to a proof that this axiom is the shortest possible, but the proof was apparently never completed.

An obscure Irish lecturer, Meredith (1904-1976) became enamored with logic somewhat late in life after attending talks by Lukasiewicz and produced many remarkable results such as this axiom. From his obituary: "He did logic whenever time and opportunity presented themselves, and he did it on whatever materials came to hand: in a pub, his favored pint of porter within reach, he would use the inside of cigarette packs to write proofs for logical colleagues."

Assertion

Ref	Expression
meredith	|- (((((ph -> ps) -> (-. ch -> -. th)) -> ch) -> ta ) -> ((ta -> ph) -> (th -> ph)))

Proof of Theorem meredith

Step	Hyp	Ref	Expression
1		ax-3 5	. . . . 5 |- ((-. ch -> -. (-. ch -> (-. ph -> -. th))) -> ((-. ch -> (-. ph -> -. th)) -> ch))
2		pm2.21 71	. . . . . . 7 |- (-. ph -> (ph -> ps))
3	2	syl4 19	. . . . . 6 |- (((ph -> ps) -> (-. ch -> -. th)) -> (-. ph -> (-. ch -> -. th)))
4	3	com23 32	. . . . 5 |- (((ph -> ps) -> (-. ch -> -. th)) -> (-. ch -> (-. ph -> -. th)))
5	1, 4	syl5 22	. . . 4 |- ((-. ch -> -. (-. ch -> (-. ph -> -. th))) -> (((ph -> ps) -> (-. ch -> -. th)) -> ch))
6	5	syl4 19	. . 3 |- (((((ph -> ps) -> (-. ch -> -. th)) -> ch) -> ta ) -> ((-. ch -> -. (-. ch -> (-. ph -> -. th))) -> ta ))
7	6	con3d 87	. 2 |- (((((ph -> ps) -> (-. ch -> -. th)) -> ch) -> ta ) -> (-. ta -> -. (-. ch -> -. (-. ch -> (-. ph -> -. th)))))
8		pm2.27 30	. . . . . . . . 9 |- (-. ch -> ((-. ch -> (-. ph -> -. th)) -> (-. ph -> -. th)))
9	8	impi 124	. . . . . . . 8 |- (-. (-. ch -> -. (-. ch -> (-. ph -> -. th))) -> (-. ph -> -. th))
10	9	com12 13	. . . . . . 7 |- (-. ph -> (-. (-. ch -> -. (-. ch -> (-. ph -> -. th))) -> -. th))
11	10	syl3d 26	. . . . . 6 |- (-. ph -> ((-. ta -> -. (-. ch -> -. (-. ch -> (-. ph -> -. th)))) -> (-. ta -> -. th)))
12	11	com12 13	. . . . 5 |- ((-. ta -> -. (-. ch -> -. (-. ch -> (-. ph -> -. th)))) -> (-. ph -> (-. ta -> -. th)))
13	12	a2d 15	. . . 4 |- ((-. ta -> -. (-. ch -> -. (-. ch -> (-. ph -> -. th)))) -> ((-. ph -> -. ta ) -> (-. ph -> -. th)))
14		con3 86	. . . 4 |- ((ta -> ph) -> (-. ph -> -. ta ))
15	13, 14	syl5 22	. . 3 |- ((-. ta -> -. (-. ch -> -. (-. ch -> (-. ph -> -. th)))) -> ((ta -> ph) -> (-. ph -> -. th)))
16		ax-3 5	. . 3 |- ((-. ph -> -. th) -> (th -> ph))
17	15, 16	syl6 23	. 2 |- ((-. ta -> -. (-. ch -> -. (-. ch -> (-. ph -> -. th)))) -> ((ta -> ph) -> (th -> ph)))
18	7, 17	syl 12	1 |- (((((ph -> ps) -> (-. ch -> -. th)) -> ch) -> ta ) -> ((ta -> ph) -> (th -> ph)))

Syntax hints:  -. wn 1   -> wi 2

This theorem is referenced by:  merlem1 645  merlem2 646  merlem3 647  merlem4 648  merlem5 649  merlem7 651  merlem8 652  merlem9 653  merlem10 654  merlem11 655  merlem13 657  luk-1 658  luk-2 659

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

metamath.org