Theorem wledi 387

Description: Half of distributive law.

Assertion

Ref	Expression
wledi	(((a ^ b) v (a ^ c)) =<2 (a ^ (b v c))) = 1

Proof of Theorem wledi

Step	Hyp	Ref	Expression
1		anidm 103	. . . 4 (((a ^ b) v (a ^ c)) ^ ((a ^ b) v (a ^ c))) = ((a ^ b) v (a ^ c))
2	1	bi1 110	. . 3 ((((a ^ b) v (a ^ c)) ^ ((a ^ b) v (a ^ c))) == ((a ^ b) v (a ^ c))) = 1
3	2	wr1 189	. 2 (((a ^ b) v (a ^ c)) == (((a ^ b) v (a ^ c)) ^ ((a ^ b) v (a ^ c)))) = 1
4		wlea 370	. . . . 5 ((a ^ b) =<2 a) = 1
5		wlea 370	. . . . 5 ((a ^ c) =<2 a) = 1
6	4, 5	wle2or 385	. . . 4 (((a ^ b) v (a ^ c)) =<2 (a v a)) = 1
7		oridm 102	. . . . 5 (a v a) = a
8	7	bi1 110	. . . 4 ((a v a) == a) = 1
9	6, 8	wlbtr 380	. . 3 (((a ^ b) v (a ^ c)) =<2 a) = 1
10		ancom 68	. . . . . 6 (a ^ b) = (b ^ a)
11	10	bi1 110	. . . . 5 ((a ^ b) == (b ^ a)) = 1
12		wlea 370	. . . . 5 ((b ^ a) =<2 b) = 1
13	11, 12	wbltr 379	. . . 4 ((a ^ b) =<2 b) = 1
14		ancom 68	. . . . . 6 (a ^ c) = (c ^ a)
15	14	bi1 110	. . . . 5 ((a ^ c) == (c ^ a)) = 1
16		wlea 370	. . . . 5 ((c ^ a) =<2 c) = 1
17	15, 16	wbltr 379	. . . 4 ((a ^ c) =<2 c) = 1
18	13, 17	wle2or 385	. . 3 (((a ^ b) v (a ^ c)) =<2 (b v c)) = 1
19	9, 18	wle2an 386	. 2 ((((a ^ b) v (a ^ c)) ^ ((a ^ b) v (a ^ c))) =<2 (a ^ (b v c))) = 1
20	3, 19	wbltr 379	1 (((a ^ b) v (a ^ c)) =<2 (a ^ (b v c))) = 1

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

This theorem is referenced by:  wfh1 405  wfh2 406

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