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

Theorem wcbtr 393
Description: Transitive inference.
Hypotheses
Ref Expression
wcbtr.1 C (a, b) = 1
wcbtr.2 (b == c) = 1
Assertion
Ref Expression
wcbtr C (a, c) = 1

Proof of Theorem wcbtr
StepHypRef Expression
1 wcbtr.1 . . . 4 C (a, b) = 1
21wdf-c2 366 . . 3 (a == ((a ^ b) v (a ^ b_|_))) = 1
3 wcbtr.2 . . . . 5 (b == c) = 1
43wlan 352 . . . 4 ((a ^ b) == (a ^ c)) = 1
53wr4 191 . . . . 5 (b_|_ == c_|_) = 1
65wlan 352 . . . 4 ((a ^ b_|_) == (a ^ c_|_)) = 1
74, 6w2or 354 . . 3 (((a ^ b) v (a ^ b_|_)) == ((a ^ c) v (a ^ c_|_))) = 1
82, 7wr2 353 . 2 (a == ((a ^ c) v (a ^ c_|_))) = 1
98wdf-c1 365 1 C (a, c) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7  1wt 9   C wcmtr 28
This theorem is referenced by:  wcom2an 410  wnbdi 411  ska2 414  ska4 415  woml6 418
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-wom 343
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le 121  df-le1 122  df-le2 123  df-cmtr 126
metamath.org