[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem i1i2 258
Description: Correspondence between Sasaki and Dishkant conditionals.
Assertion
Ref Expression
i1i2 (a ->1 b) = (b_|_ ->2 a_|_)

Proof of Theorem i1i2
StepHypRef Expression
1 ax-a1 29 . . . . 5 a = a_|__|_
2 ax-a1 29 . . . . 5 b = b_|__|_
31, 22an 72 . . . 4 (a ^ b) = (a_|__|_ ^ b_|__|_)
4 ancom 68 . . . 4 (a_|__|_ ^ b_|__|_) = (b_|__|_ ^ a_|__|_)
53, 4ax-r2 35 . . 3 (a ^ b) = (b_|__|_ ^ a_|__|_)
65lor 66 . 2 (a_|_ v (a ^ b)) = (a_|_ v (b_|__|_ ^ a_|__|_))
7 df-i1 43 . 2 (a ->1 b) = (a_|_ v (a ^ b))
8 df-i2 44 . 2 (b_|_ ->2 a_|_) = (a_|_ v (b_|__|_ ^ a_|__|_))
96, 7, 83tr1 60 1 (a ->1 b) = (b_|_ ->2 a_|_)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ->2 wi2 14
This theorem is referenced by:  i2i1 259  i1i2con1 260  i1i2con2 261  nom41 318  1oai1 803  2oath1i1 809  oal1 980
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-i1 43  df-i2 44
metamath.org