Theorem cdleme0fN 40316

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 1198	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝐾 ∈ HL)
3	2	hllatd 39462	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝐾 ∈ Lat)
4		simp2l 1200	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
5		eqid 2731	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
6		cdleme0.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
7	5, 6	atbase 39387	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
8	4, 7	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑃 ∈ (Base‘𝐾))
9		simp3r 1203	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑅 ∈ 𝐴)
10	5, 6	atbase 39387	. . . . . 6 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾))
11	9, 10	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑅 ∈ (Base‘𝐾))
12		cdleme0.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
13	5, 12	latjcl 18345	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
14	3, 8, 11, 13	syl3anc 1373	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
15		simp1r 1199	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑊 ∈ 𝐻)
16		cdleme0.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
17	5, 16	lhpbase 40096	. . . . 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 18371	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑅) ∧ 𝑊) ≤ 𝑊)
22	3, 14, 18, 21	syl3anc 1373	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑃 ∨ 𝑅) ∧ 𝑊) ≤ 𝑊)
23	1, 22	eqbrtrid 5124	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑉 ≤ 𝑊)
24		simp2r 1201	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ¬ 𝑃 ≤ 𝑊)
25		nbrne2 5109	. 2 ⊢ ((𝑉 ≤ 𝑊 ∧ ¬ 𝑃 ≤ 𝑊) → 𝑉 ≠ 𝑃)
26	23, 24, 25	syl2anc 584	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → 𝑉 ≠ 𝑃)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111   ≠ wne 2928   class class class wbr 5089  ‘cfv 6481  (class class class)co 7346  Basecbs 17120  lecple 17168  joincjn 18217  meetcmee 18218  Latclat 18337  Atomscatm 39361  HLchlt 39448  LHypclh 40082

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-lub 18250  df-glb 18251  df-join 18252  df-meet 18253  df-lat 18338  df-ats 39365  df-atl 39396  df-cvlat 39420  df-hlat 39449  df-lhyp 40086

This theorem is referenced by: (None)