Theorem cdleme4 41297

Description: Part of proof of Lemma E in [Crawley] p. 113. 𝐹 and 𝐺 represent f(s) and f_s(r). Here show p ∨ q = r ∨ u at the top of p. 114. (Contributed by NM, 7-Jun-2012.)

Hypotheses

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

Assertion

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

Proof of Theorem cdleme4

Step	Hyp	Ref	Expression
1		cdleme4.u	. . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
2	1	oveq2i 7432	. 2 ⊢ (𝑅 ∨ 𝑈) = (𝑅 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊))
3		simp1l 1216	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝐾 ∈ HL)
4		simp23l 1313	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑅 ∈ 𝐴)
5		simp21 1225	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ∈ 𝐴)
6		simp22 1226	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑄 ∈ 𝐴)
7		eqid 2761	. . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾)
8		cdleme4.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
9		cdleme4.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
10	7, 8, 9	hlatjcl 40426	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
11	3, 5, 6, 10	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
12		simp1r 1217	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑊 ∈ 𝐻)
13		cdleme4.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
14	7, 13	lhpbase 41057	. . . . 5 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
15	12, 14	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑊 ∈ (Base‘𝐾))
16		simp3 1156	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑅 ≤ (𝑃 ∨ 𝑄))
17		cdleme4.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
18		cdleme4.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
19	7, 17, 8, 18, 9	atmod3i1 40923	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑅 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) = ((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑊)))
20	3, 4, 11, 15, 16, 19	syl131anc 1410	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑅 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) = ((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑊)))
21		simp1 1154	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
22		simp23 1227	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊))
23		eqid 2761	. . . . . 6 ⊢ (1.‘𝐾) = (1.‘𝐾)
24	17, 8, 23, 9, 13	lhpjat2 41080	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑅 ∨ 𝑊) = (1.‘𝐾))
25	21, 22, 24	syl2anc 596	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑅 ∨ 𝑊) = (1.‘𝐾))
26	25	oveq2d 7437	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑊)) = ((𝑃 ∨ 𝑄) ∧ (1.‘𝐾)))
27		hlol 40420	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
28	3, 27	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝐾 ∈ OL)
29	7, 18, 23	olm11 40286	. . . 4 ⊢ ((𝐾 ∈ OL ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑄) ∧ (1.‘𝐾)) = (𝑃 ∨ 𝑄))
30	28, 11, 29	syl2anc 596	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ (1.‘𝐾)) = (𝑃 ∨ 𝑄))
31	20, 26, 30	3eqtrd 2800	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑅 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑊)) = (𝑃 ∨ 𝑄))
32	2, 31	eqtr2id 2809	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑈))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5103  ‘cfv 6539  (class class class)co 7421  Basecbs 17388  lecple 17436  joincjn 18486  meetcmee 18487  1.cp1 18597  OLcol 40233  Atomscatm 40322  HLchlt 40409  LHypclh 41043

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 7752

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 3900  df-un 3902  df-in 3904  df-ss 3915  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 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-proset 18469  df-poset 18488  df-plt 18503  df-lub 18519  df-glb 18520  df-join 18521  df-meet 18522  df-p0 18598  df-p1 18599  df-lat 18607  df-clat 18674  df-oposet 40235  df-ol 40237  df-oml 40238  df-covers 40325  df-ats 40326  df-atl 40357  df-cvlat 40381  df-hlat 40410  df-psubsp 40562  df-pmap 40563  df-padd 40855  df-lhyp 41047

This theorem is used by:  cdleme5  41299  cdleme7aa  41301  cdleme7c  41304  cdleme7e  41306  cdleme20i  41376  cdleme36a  41519  cdleme37m  41521  cdleme39a  41524