Theorem wbctr 392

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

Step	Hyp	Ref	Expression
1		wbctr.2	. . . 4 C (b, c) = 1
2	1	wdf-c2 366	. . 3 (b ≡ ((b ∩ c) ∪ (b ∩ c⊥ ))) = 1
3		wbctr.1	. . 3 (a ≡ b) = 1
4	3	wran 351	. . . 4 ((a ∩ c) ≡ (b ∩ c)) = 1
5	3	wran 351	. . . 4 ((a ∩ c⊥ ) ≡ (b ∩ c⊥ )) = 1
6	4, 5	w2or 354	. . 3 (((a ∩ c) ∪ (a ∩ c⊥ )) ≡ ((b ∩ c) ∪ (b ∩ c⊥ ))) = 1
7	2, 3, 6	w3tr1 356	. 2 (a ≡ ((a ∩ c) ∪ (a ∩ c⊥ ))) = 1
8	7	wdf-c1 365	1 C (a, c) = 1

Syntax hints:   = wb 1  ^⊥ wn 4   ≡ tb 5   ∪ wo 6   ∩ wa 7  1wt 9   C wcmtr 28

This theorem is referenced by:  woml7 419

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