HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem biluk 743
Description: Lukasiewicz's shortest axiom for equivalential calculus. Storrs McCall, ed., Polish Logic 1920-1939 (Oxford, 1967), p. 96.
Assertion
Ref Expression
biluk |- ((ph <-> ps) <-> ((ch <-> ps) <-> (ph <-> ch)))

Proof of Theorem biluk
StepHypRef Expression
1 bicom 518 . . . . 5 |- ((ph <-> ps) <-> (ps <-> ph))
21bibi1i 607 . . . 4 |- (((ph <-> ps) <-> ch) <-> ((ps <-> ph) <-> ch))
3 biass 742 . . . 4 |- (((ps <-> ph) <-> ch) <-> (ps <-> (ph <-> ch)))
42, 3bitr 173 . . 3 |- (((ph <-> ps) <-> ch) <-> (ps <-> (ph <-> ch)))
5 biass 742 . . 3 |- ((((ph <-> ps) <-> ch) <-> (ps <-> (ph <-> ch))) <-> ((ph <-> ps) <-> (ch <-> (ps <-> (ph <-> ch)))))
64, 5mpbi 189 . 2 |- ((ph <-> ps) <-> (ch <-> (ps <-> (ph <-> ch))))
7 biass 742 . 2 |- (((ch <-> ps) <-> (ph <-> ch)) <-> (ch <-> (ps <-> (ph <-> ch))))
86, 7bitr4 176 1 |- ((ph <-> ps) <-> ((ch <-> ps) <-> (ph <-> ch)))
Colors of variables: wff set class
Syntax hints:   <-> wb 146
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225
Copyright terms: Public domain