Theorem cdleme17c 35575

Description: Part of proof of Lemma E in [Crawley] p. 114, first part of 4th paragraph. 𝐶 represents s₁. We show, in their notation, (p ∨ q) ∧ (q ∨ s₁)=q. (Contributed by NM, 11-Oct-2012.)

Hypotheses

Ref	Expression
cdleme17.l	⊢ ≤ = (le‘𝐾)
cdleme17.j	⊢ ∨ = (join‘𝐾)
cdleme17.m	⊢ ∧ = (meet‘𝐾)
cdleme17.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme17.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme17.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme17.f	⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊)))
cdleme17.g	⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊)))
cdleme17.c	⊢ 𝐶 = ((𝑃 ∨ 𝑆) ∧ 𝑊)

Assertion

Ref	Expression
cdleme17c	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶)) = 𝑄)

Proof of Theorem cdleme17c

Step	Hyp	Ref	Expression
1		simp1l 1085	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝐾 ∈ HL)
2		simp2l 1087	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ∈ 𝐴)
3		simp31 1097	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑄 ∈ 𝐴)
4		cdleme17.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
5		cdleme17.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	hlatjcom 34654	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
7	1, 2, 3, 6	syl3anc 1326	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
8	7	oveq1d 6665	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶)) = ((𝑄 ∨ 𝑃) ∧ (𝑄 ∨ 𝐶)))
9		simp1r 1086	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑊 ∈ 𝐻)
10		simp2r 1088	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ¬ 𝑃 ≤ 𝑊)
11		simp32 1098	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ∈ 𝐴)
12		hllat 34650	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
13	1, 12	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝐾 ∈ Lat)
14		eqid 2622	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
15	14, 5	atbase 34576	. . . . . 6 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ (Base‘𝐾))
16	11, 15	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ∈ (Base‘𝐾))
17	14, 5	atbase 34576	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
18	2, 17	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ∈ (Base‘𝐾))
19	14, 5	atbase 34576	. . . . . 6 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
20	3, 19	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑄 ∈ (Base‘𝐾))
21		simp33 1099	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))
22		cdleme17.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
23	14, 22, 4	latnlej1l 17069	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑆 ∈ (Base‘𝐾) ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝑆 ≠ 𝑃)
24	23	necomd 2849	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑆 ∈ (Base‘𝐾) ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ≠ 𝑆)
25	13, 16, 18, 20, 21, 24	syl131anc 1339	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ≠ 𝑆)
26		cdleme17.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
27		cdleme17.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
28		cdleme17.c	. . . . 5 ⊢ 𝐶 = ((𝑃 ∨ 𝑆) ∧ 𝑊)
29	22, 4, 26, 5, 27, 28	cdleme9a 35538	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑆)) → 𝐶 ∈ 𝐴)
30	1, 9, 2, 10, 11, 25, 29	syl222anc 1342	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝐶 ∈ 𝐴)
31		cdleme17.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
32		cdleme17.f	. . . 4 ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊)))
33		cdleme17.g	. . . 4 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊)))
34	22, 4, 26, 5, 27, 31, 32, 33, 28	cdleme17b 35574	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ¬ 𝐶 ≤ (𝑃 ∨ 𝑄))
35	22, 4, 26, 5	2llnma1 35073	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐶 ≤ (𝑃 ∨ 𝑄)) → ((𝑄 ∨ 𝑃) ∧ (𝑄 ∨ 𝐶)) = 𝑄)
36	1, 2, 3, 30, 34, 35	syl131anc 1339	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑄 ∨ 𝑃) ∧ (𝑄 ∨ 𝐶)) = 𝑄)
37	8, 36	eqtrd 2656	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶)) = 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990   ≠ wne 2794   class class class wbr 4653  ‘cfv 5888  (class class class)co 6650  Basecbs 15857  lecple 15948  joincjn 16944  meetcmee 16945  Latclat 17045  Atomscatm 34550  HLchlt 34637  LHypclh 35270

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-iin 4523  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-preset 16928  df-poset 16946  df-plt 16958  df-lub 16974  df-glb 16975  df-join 16976  df-meet 16977  df-p0 17039  df-p1 17040  df-lat 17046  df-clat 17108  df-oposet 34463  df-ol 34465  df-oml 34466  df-covers 34553  df-ats 34554  df-atl 34585  df-cvlat 34609  df-hlat 34638  df-psubsp 34789  df-pmap 34790  df-padd 35082  df-lhyp 35274

This theorem is referenced by:  cdleme17d1  35576