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

Theorem nom65 334
Description: Part of Lemma 3.3(15) from "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nom65 (b == (a v b)) = (a ->2 b)

Proof of Theorem nom65
StepHypRef Expression
1 bicom 88 . 2 (b == (a v b)) = ((a v b) == b)
2 nom55 328 . 2 ((a v b) == b) = (a ->2 b)
31, 2ax-r2 35 1 (b == (a v b)) = (a ->2 b)
Colors of variables: term
Syntax hints:   = wb 1   == tb 5   v wo 6   ->2 wi2 14
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44
metamath.org