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

Theorem ud3lem0c 271
Description: Lemma for unified disjunction.
Assertion
Ref Expression
ud3lem0c (a ->3 b)_|_ = (((a v b_|_) ^ (a v b)) ^ (a_|_ v (a ^ b_|_)))

Proof of Theorem ud3lem0c
StepHypRef Expression
1 ni31 242 1 (a ->3 b)_|_ = (((a v b_|_) ^ (a v b)) ^ (a_|_ v (a ^ b_|_)))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->3 wi3 15
This theorem is referenced by:  ud3lem1a 548  ud3lem1b 549  ud3lem1c 550  ud3lem3a 554  ud3lem3b 555  ud3lem3c 556  ud3lem3 558  u3lem14mp 776
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-i3 45
metamath.org