Theorem i3orcom 507

Description: Commutative law for conjunction with Kalmbach implication.

Assertion

Ref	Expression
i3orcom	((a ∪ b) →3 (b ∪ a)) = 1

Proof of Theorem i3orcom

Step	Hyp	Ref	Expression
1		i3id 243	. 2 ((b ∪ a) →3 (b ∪ a)) = 1
2		ax-a2 30	. . . 4 (b ∪ a) = (a ∪ b)
3	2	ri3 245	. . 3 ((b ∪ a) →3 (b ∪ a)) = ((a ∪ b) →3 (b ∪ a))
4	3	bi1 110	. 2 (((b ∪ a) →3 (b ∪ a)) ≡ ((a ∪ b) →3 (b ∪ a))) = 1
5	1, 4	wwbmp 197	1 ((a ∪ b) →3 (b ∪ a)) = 1

Syntax hints:   = wb 1   ∪ wo 6  1wt 9   →₃ wi3 15

This theorem is referenced by:  i3lor 515

This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37

This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i3 45

metamath.org