Theorem cdleme35e 41490

Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. (Contributed by NM, 10-Mar-2013.)

Hypotheses

Ref	Expression
cdleme35.l	⊢ ≤ = (le‘𝐾)
cdleme35.j	⊢ ∨ = (join‘𝐾)
cdleme35.m	⊢ ∧ = (meet‘𝐾)
cdleme35.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme35.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme35.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme35.f	⊢ 𝐹 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)))

Assertion

Ref	Expression
cdleme35e	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ ((𝑄 ∨ 𝐹) ∧ 𝑊)) = (𝑃 ∨ 𝑅))

Proof of Theorem cdleme35e

Step	Hyp	Ref	Expression
1		cdleme35.l	. . . 4 ⊢ ≤ = (le‘𝐾)
2		cdleme35.j	. . . 4 ⊢ ∨ = (join‘𝐾)
3		cdleme35.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
4		cdleme35.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
5		cdleme35.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
6		cdleme35.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
7		cdleme35.f	. . . 4 ⊢ 𝐹 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)))
8	1, 2, 3, 4, 5, 6, 7	cdleme35d 41489	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑄 ∨ 𝐹) ∧ 𝑊) = ((𝑃 ∨ 𝑅) ∧ 𝑊))
9	8	oveq2d 7434	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ ((𝑄 ∨ 𝐹) ∧ 𝑊)) = (𝑃 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)))
10		simp11l 1303	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝐾 ∈ HL)
11		simp12l 1305	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ∈ 𝐴)
12		simp2rl 1261	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑅 ∈ 𝐴)
13		eqid 2761	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
14	13, 2, 4	hlatjcl 40404	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
15	10, 11, 12, 14	syl3anc 1398	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
16		simp11r 1304	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑊 ∈ 𝐻)
17	13, 5	lhpbase 41035	. . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
18	16, 17	syl 18	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑊 ∈ (Base‘𝐾))
19	1, 2, 4	hlatlej1 40412	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → 𝑃 ≤ (𝑃 ∨ 𝑅))
20	10, 11, 12, 19	syl3anc 1398	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ≤ (𝑃 ∨ 𝑅))
21	13, 1, 2, 3, 4	atmod3i1 40901	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ 𝑃 ≤ (𝑃 ∨ 𝑅)) → (𝑃 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)) = ((𝑃 ∨ 𝑅) ∧ (𝑃 ∨ 𝑊)))
22	10, 11, 15, 18, 20, 21	syl131anc 1410	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊)) = ((𝑃 ∨ 𝑅) ∧ (𝑃 ∨ 𝑊)))
23		simp11 1222	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
24		simp12 1223	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
25		eqid 2761	. . . . . 6 ⊢ (1.‘𝐾) = (1.‘𝐾)
26	1, 2, 25, 4, 5	lhpjat2 41058	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ 𝑊) = (1.‘𝐾))
27	23, 24, 26	syl2anc 596	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ 𝑊) = (1.‘𝐾))
28	27	oveq2d 7434	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑅) ∧ (𝑃 ∨ 𝑊)) = ((𝑃 ∨ 𝑅) ∧ (1.‘𝐾)))
29		hlol 40398	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
30	10, 29	syl 18	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝐾 ∈ OL)
31	13, 3, 25	olm11 40264	. . . 4 ⊢ ((𝐾 ∈ OL ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑅) ∧ (1.‘𝐾)) = (𝑃 ∨ 𝑅))
32	30, 15, 31	syl2anc 596	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑅) ∧ (1.‘𝐾)) = (𝑃 ∨ 𝑅))
33	28, 32	eqtrd 2796	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑅) ∧ (𝑃 ∨ 𝑊)) = (𝑃 ∨ 𝑅))
34	9, 22, 33	3eqtrd 2800	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ ((𝑄 ∨ 𝐹) ∧ 𝑊)) = (𝑃 ∨ 𝑅))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   class class class wbr 5103  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  lecple 17428  joincjn 18478  meetcmee 18479  1.cp1 18589  OLcol 40211  Atomscatm 40300  HLchlt 40387  LHypclh 41021

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-proset 18461  df-poset 18480  df-plt 18495  df-lub 18511  df-glb 18512  df-join 18513  df-meet 18514  df-p0 18590  df-p1 18591  df-lat 18599  df-clat 18666  df-oposet 40213  df-ol 40215  df-oml 40216  df-covers 40303  df-ats 40304  df-atl 40335  df-cvlat 40359  df-hlat 40388  df-psubsp 40540  df-pmap 40541  df-padd 40833  df-lhyp 41025

This theorem is used by:  cdleme35g  41492