Theorem wle2or 385

Description: Disjunction of 2 l.e.'s

Hypotheses

Ref	Expression
wle2.1	(a =<2 b) = 1
wle2.2	(c =<2 d) = 1

Assertion

Ref	Expression
wle2or	((a v c) =<2 (b v d)) = 1

Proof of Theorem wle2or

Step	Hyp	Ref	Expression
1		wle2.1	. . 3 (a =<2 b) = 1
2	1	wleror 375	. 2 ((a v c) =<2 (b v c)) = 1
3		wle2.2	. . . 4 (c =<2 d) = 1
4	3	wleror 375	. . 3 ((c v b) =<2 (d v b)) = 1
5		ax-a2 30	. . . 4 (b v c) = (c v b)
6	5	bi1 110	. . 3 ((b v c) == (c v b)) = 1
7		ax-a2 30	. . . 4 (b v d) = (d v b)
8	7	bi1 110	. . 3 ((b v d) == (d v b)) = 1
9	4, 6, 8	wle3tr1 381	. 2 ((b v c) =<2 (b v d)) = 1
10	2, 9	wletr 378	1 ((a v c) =<2 (b v d)) = 1

Syntax hints:   = wb 1   v wo 6  1wt 9   =<2 wle2 11

This theorem is referenced by:  wledi 387  wledio 388

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

metamath.org