Theorem wcomorr 412

Description: Weak commutation law. (Contributed by NM, 13-Oct-1997.)

Assertion

Ref	Expression
wcomorr	C (a, (a ∪ b)) = 1

Proof of Theorem wcomorr

Step	Hyp	Ref	Expression
1		wleo 387	. 2 (a ≤2 (a ∪ b)) = 1
2	1	wlecom 409	1 C (a, (a ∪ b)) = 1

Syntax hints:   = wb 1   ∪ wo 6  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:  wnbdi  429  ska2  432  ska4  433  woml6  436