Theorem combi 467

Description: Commutation theorem for Sasaki implication.

Assertion

Ref	Expression
combi	a C (a == b)

Proof of Theorem combi

Step	Hyp	Ref	Expression
1		comanr1 446	. . 3 a C (a ^ b)
2		comanr1 446	. . . 4 a_|_ C (a_|_ ^ b_|_)
3	2	comcom6 441	. . 3 a C (a_|_ ^ b_|_)
4	1, 3	com2or 465	. 2 a C ((a ^ b) v (a_|_ ^ b_|_))
5		dfb 86	. . 3 (a == b) = ((a ^ b) v (a_|_ ^ b_|_))
6	5	ax-r1 34	. 2 ((a ^ b) v (a_|_ ^ b_|_)) = (a == b)
7	4, 6	cbtr 174	1 a C (a == b)

Syntax hints:   C wc 3  _|_wn 4   == tb 5   v wo 6   ^ wa 7

This theorem is referenced by:  ublemc1 710

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-r3 421

This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-le1 122  df-le2 123  df-c1 124  df-c2 125

metamath.org