Theorem oa4to6lem2 941

Description: Lemma for orthoarguesian law (4-variable to 6-variable proof).

Hypotheses

Ref	Expression
oa4to6lem.1	a⊥ ≤ b
oa4to6lem.2	c⊥ ≤ d
oa4to6lem.3	e⊥ ≤ f
oa4to6lem.4	g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))

Assertion

Ref	Expression
oa4to6lem2	d ≤ (c →1 g)

Proof of Theorem oa4to6lem2

Step	Hyp	Ref	Expression
1		leor 151	. . . 4 d ≤ (c⊥ ∪ d)
2		comid 179	. . . . . . . . 9 c C c
3	2	comcom3 436	. . . . . . . 8 c⊥ C c
4		oa4to6lem.2	. . . . . . . . 9 c⊥ ≤ d
5	4	lecom 172	. . . . . . . 8 c⊥ C d
6	3, 5	fh3 453	. . . . . . 7 (c⊥ ∪ (c ∩ d)) = ((c⊥ ∪ c) ∩ (c⊥ ∪ d))
7		ancom 68	. . . . . . . 8 (1 ∩ (c⊥ ∪ d)) = ((c⊥ ∪ d) ∩ 1)
8		df-t 40	. . . . . . . . . 10 1 = (c ∪ c⊥ )
9		ax-a2 30	. . . . . . . . . 10 (c ∪ c⊥ ) = (c⊥ ∪ c)
10	8, 9	ax-r2 35	. . . . . . . . 9 1 = (c⊥ ∪ c)
11	10	ran 71	. . . . . . . 8 (1 ∩ (c⊥ ∪ d)) = ((c⊥ ∪ c) ∩ (c⊥ ∪ d))
12		an1 98	. . . . . . . 8 ((c⊥ ∪ d) ∩ 1) = (c⊥ ∪ d)
13	7, 11, 12	3tr2 61	. . . . . . 7 ((c⊥ ∪ c) ∩ (c⊥ ∪ d)) = (c⊥ ∪ d)
14	6, 13	ax-r2 35	. . . . . 6 (c⊥ ∪ (c ∩ d)) = (c⊥ ∪ d)
15	14	ax-r1 34	. . . . 5 (c⊥ ∪ d) = (c⊥ ∪ (c ∩ d))
16		anidm 103	. . . . . . . . 9 (c ∩ c) = c
17	16	ran 71	. . . . . . . 8 ((c ∩ c) ∩ d) = (c ∩ d)
18	17	ax-r1 34	. . . . . . 7 (c ∩ d) = ((c ∩ c) ∩ d)
19		anass 69	. . . . . . 7 ((c ∩ c) ∩ d) = (c ∩ (c ∩ d))
20	18, 19	ax-r2 35	. . . . . 6 (c ∩ d) = (c ∩ (c ∩ d))
21	20	lor 66	. . . . 5 (c⊥ ∪ (c ∩ d)) = (c⊥ ∪ (c ∩ (c ∩ d)))
22	15, 21	ax-r2 35	. . . 4 (c⊥ ∪ d) = (c⊥ ∪ (c ∩ (c ∩ d)))
23	1, 22	lbtr 131	. . 3 d ≤ (c⊥ ∪ (c ∩ (c ∩ d)))
24		leor 151	. . . . . 6 (c ∩ d) ≤ (((a ∩ b) ∪ (e ∩ f)) ∪ (c ∩ d))
25		or32 75	. . . . . 6 (((a ∩ b) ∪ (e ∩ f)) ∪ (c ∩ d)) = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))
26	24, 25	lbtr 131	. . . . 5 (c ∩ d) ≤ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))
27	26	lelan 159	. . . 4 (c ∩ (c ∩ d)) ≤ (c ∩ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)))
28	27	lelor 158	. . 3 (c⊥ ∪ (c ∩ (c ∩ d))) ≤ (c⊥ ∪ (c ∩ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))))
29	23, 28	letr 129	. 2 d ≤ (c⊥ ∪ (c ∩ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))))
30		oa4to6lem.4	. . . . 5 g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))
31	30	ud1lem0a 247	. . . 4 (c →1 g) = (c →1 (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)))
32		df-i1 43	. . . 4 (c →1 (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))) = (c⊥ ∪ (c ∩ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))))
33	31, 32	ax-r2 35	. . 3 (c →1 g) = (c⊥ ∪ (c ∩ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))))
34	33	ax-r1 34	. 2 (c⊥ ∪ (c ∩ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)))) = (c →1 g)
35	29, 34	lbtr 131	1 d ≤ (c →1 g)

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

This theorem is referenced by:  oa4to6lem4 943

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-r3 421

This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-le1 122  df-le2 123  df-c1 124  df-c2 125

metamath.org