Theorem womle2b 296

Description: An equivalent to the WOM law.

Hypothesis

Ref	Expression
womle2b.1	((a →2 b)⊥ ∪ (a →1 b)) = 1

Assertion

Ref	Expression
womle2b	(a ∩ (a →2 b)) ≤ ((a →2 b)⊥ ∪ (a →1 b))

Proof of Theorem womle2b

Step	Hyp	Ref	Expression
1		le1 146	. 2 (a ∩ (a →2 b)) ≤ 1
2		womle2b.1	. . 3 ((a →2 b)⊥ ∪ (a →1 b)) = 1
3	2	ax-r1 35	. 2 1 = ((a →2 b)⊥ ∪ (a →1 b))
4	1, 3	lbtr 139	1 (a ∩ (a →2 b)) ≤ ((a →2 b)⊥ ∪ (a →1 b))

Syntax hints:   = wb 1   ≤ wle 2  ^⊥ wn 4   ∪ wo 6   ∩ wa 7  1wt 8   →₁ wi1 12   →₂ wi2 13

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

This theorem depends on definitions:  df-a 40  df-t 41  df-le1 130  df-le2 131

Copyright terms: Public domain