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

Theorem nom10 307
Description: Part of Lemma 3.3(14) from "Non-Orthomodular Models..." paper.
Assertion
Ref Expression
nom10 (a ->0 (a ^ b)) = (a ->1 b)

Proof of Theorem nom10
StepHypRef Expression
1 id 59 . 2 (a' v (a ^ b)) = (a' v (a ^ b))
2 df-i0 43 . 2 (a ->0 (a ^ b)) = (a' v (a ^ b))
3 df-i1 44 . 2 (a ->1 b) = (a' v (a ^ b))
41, 2, 33tr1 63 1 (a ->0 (a ^ b)) = (a ->1 b)
Colors of variables: term
Syntax hints:   = wb 1  'wn 4   v wo 6   ^ wa 7   ->0 wi0 11   ->1 wi1 12
This theorem is referenced by:  nom40 325  lem3.3.7i0e3 1058
This theorem was proved from axioms:  ax-a1 30  ax-r1 35  ax-r2 36
This theorem depends on definitions:  df-i0 43  df-i1 44
Copyright terms: Public domain