Theorem cdleme0fN 38159

Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 14-Jun-2012.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
cdleme0fN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑉 ≠ 𝑃)

Proof of Theorem cdleme0fN

Step	Hyp	Ref	Expression
1		cdleme0c.3	. . 3 ⊢ 𝑉 = ((𝑃 ∨ 𝑅) ∧ 𝑊)
2		simp1l 1195	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝐾 ∈ HL)
3	2	hllatd 37305	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝐾 ∈ Lat)
4		simp2l 1197	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
5		eqid 2738	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
6		cdleme0.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
7	5, 6	atbase 37230	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
8	4, 7	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑃 ∈ (Base‘𝐾))
9		simp3r 1200	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑅 ∈ 𝐴)
10	5, 6	atbase 37230	. . . . . 6 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾))
11	9, 10	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑅 ∈ (Base‘𝐾))
12		cdleme0.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
13	5, 12	latjcl 18072	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
14	3, 8, 11, 13	syl3anc 1369	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
15		simp1r 1196	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑊 ∈ 𝐻)
16		cdleme0.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
17	5, 16	lhpbase 37939	. . . . 5 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
18	15, 17	syl 17	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑊 ∈ (Base‘𝐾))
19		cdleme0.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
20		cdleme0.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
21	5, 19, 20	latmle2 18098	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑅) ∧ 𝑊) ≤ 𝑊)
22	3, 14, 18, 21	syl3anc 1369	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑃 ∨ 𝑅) ∧ 𝑊) ≤ 𝑊)
23	1, 22	eqbrtrid 5105	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑉 ≤ 𝑊)
24		simp2r 1198	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ¬ 𝑃 ≤ 𝑊)
25		nbrne2 5090	. 2 ⊢ ((𝑉 ≤ 𝑊 ∧ ¬ 𝑃 ≤ 𝑊) → 𝑉 ≠ 𝑃)
26	23, 24, 25	syl2anc 583	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑉 ≠ 𝑃)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ≠ wne 2942   class class class wbr 5070  ‘cfv 6418  (class class class)co 7255  Basecbs 16840  lecple 16895  joincjn 17944  meetcmee 17945  Latclat 18064  Atomscatm 37204  HLchlt 37291  LHypclh 37925

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-lub 17979  df-glb 17980  df-join 17981  df-meet 17982  df-lat 18065  df-ats 37208  df-atl 37239  df-cvlat 37263  df-hlat 37292  df-lhyp 37929

This theorem is referenced by: (None)