QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  wbctr Unicode version
Theorem wbctr 410
Description: Transitive inference.
Hypotheses
Ref Expression
wbctr.1 (a == b) = 1
wbctr.2 C (b, c) = 1
Assertion
Ref Expression
wbctr C (a, c) = 1
Proof of Theorem wbctr
StepHypRef Expression
1 wbctr.2 . . . 4 C (b, c) = 1
21wdf-c2 384 . . 3 (b == ((b ^ c) v (b ^ c'))) = 1
3 wbctr.1 . . 3 (a == b) = 1
43wran 369 . . . 4 ((a ^ c) == (b ^ c)) = 1
53wran 369 . . . 4 ((a ^ c') == (b ^ c')) = 1
64, 5w2or 372 . . 3 (((a ^ c) v (a ^ c')) == ((b ^ c) v (b ^ c'))) = 1
72, 3, 6w3tr1 374 . 2 (a == ((a ^ c) v (a ^ c'))) = 1
87wdf-c1 383 1 C (a, c) = 1
Colors of variables: term
Syntax hints:   = wb 1  'wn 4   == tb 5   v wo 6   ^ wa 7  1wt 8   C wcmtr 29
This theorem was proved from axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a4 33  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-wom 361
This theorem depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i1 44  df-i2 45  df-le 129  df-le1 130  df-le2 131  df-cmtr 134
This theorem is referenced by:  woml7  437
  Copyright terms: Public domain W3C validator