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

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

Proof of Theorem i1i2con2
StepHypRef Expression
1 i1i2 258 . 2 (a_|_ ->1 b) = (b_|_ ->2 a_|__|_)
2 ax-a1 29 . . . 4 a = a_|__|_
32ax-r1 34 . . 3 a_|__|_ = a
43ud2lem0a 250 . 2 (b_|_ ->2 a_|__|_) = (b_|_ ->2 a)
51, 4ax-r2 35 1 (a_|_ ->1 b) = (b_|_ ->2 a)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   ->1 wi1 13   ->2 wi2 14
This theorem is referenced by:  2oai1u 804  1oath1i1u 810
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