Theorem cdleme11dN 37392

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

Hypotheses

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

Assertion

Ref	Expression
cdleme11dN	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → (𝑃 ∨ 𝑆) ≠ (𝑃 ∨ 𝑇))

Proof of Theorem cdleme11dN

Step	Hyp	Ref	Expression
1		simp1 1132	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴))
2		simp2 1133	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄))
3		simp32 1206	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))
4		simp33 1207	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑈 ≤ (𝑆 ∨ 𝑇))
5		cdleme11.l	. . . 4 ⊢ ≤ = (le‘𝐾)
6		cdleme11.j	. . . 4 ⊢ ∨ = (join‘𝐾)
7		cdleme11.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
8		cdleme11.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdleme11.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
10		cdleme11.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
11	5, 6, 7, 8, 9, 10	cdleme11c 37391	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ¬ 𝑃 ≤ (𝑆 ∨ 𝑇))
12	1, 2, 3, 4, 11	syl112anc 1370	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ¬ 𝑃 ≤ (𝑆 ∨ 𝑇))
13		simp11l 1280	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝐾 ∈ HL)
14		simp12l 1282	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑃 ∈ 𝐴)
15		simp21l 1286	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ∈ 𝐴)
16	5, 6, 8	hlatlej2 36506	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → 𝑆 ≤ (𝑃 ∨ 𝑆))
17	13, 14, 15, 16	syl3anc 1367	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ≤ (𝑃 ∨ 𝑆))
18		breq2 5062	. . . . 5 ⊢ ((𝑃 ∨ 𝑆) = (𝑃 ∨ 𝑇) → (𝑆 ≤ (𝑃 ∨ 𝑆) ↔ 𝑆 ≤ (𝑃 ∨ 𝑇)))
19	17, 18	syl5ibcom 247	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑃 ∨ 𝑆) = (𝑃 ∨ 𝑇) → 𝑆 ≤ (𝑃 ∨ 𝑇)))
20		simp22 1203	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑇 ∈ 𝐴)
21		simp31 1205	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ≠ 𝑇)
22	5, 6, 8	hlatexch2 36526	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑆 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ 𝑆 ≠ 𝑇) → (𝑆 ≤ (𝑃 ∨ 𝑇) → 𝑃 ≤ (𝑆 ∨ 𝑇)))
23	13, 15, 14, 20, 21, 22	syl131anc 1379	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → (𝑆 ≤ (𝑃 ∨ 𝑇) → 𝑃 ≤ (𝑆 ∨ 𝑇)))
24	19, 23	syld 47	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑃 ∨ 𝑆) = (𝑃 ∨ 𝑇) → 𝑃 ≤ (𝑆 ∨ 𝑇)))
25	24	necon3bd 3030	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → (¬ 𝑃 ≤ (𝑆 ∨ 𝑇) → (𝑃 ∨ 𝑆) ≠ (𝑃 ∨ 𝑇)))
26	12, 25	mpd 15	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ≠ 𝑇 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) → (𝑃 ∨ 𝑆) ≠ (𝑃 ∨ 𝑇))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110   ≠ wne 3016   class class class wbr 5058  ‘cfv 6349  (class class class)co 7150  lecple 16566  joincjn 17548  meetcmee 17549  Atomscatm 36393  HLchlt 36480  LHypclh 37114

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-iin 4914  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-proset 17532  df-poset 17550  df-plt 17562  df-lub 17578  df-glb 17579  df-join 17580  df-meet 17581  df-p0 17643  df-p1 17644  df-lat 17650  df-clat 17712  df-oposet 36306  df-ol 36308  df-oml 36309  df-covers 36396  df-ats 36397  df-atl 36428  df-cvlat 36452  df-hlat 36481  df-psubsp 36633  df-pmap 36634  df-padd 36926  df-lhyp 37118

This theorem is referenced by: (None)