Theorem cdleme25b 38295

Description: Transform cdleme24 38293. TODO get rid of $d's on 𝑈, 𝑁 (Contributed by NM, 1-Jan-2013.)

Hypotheses

Ref	Expression
cdleme24.b	⊢ 𝐵 = (Base‘𝐾)
cdleme24.l	⊢ ≤ = (le‘𝐾)
cdleme24.j	⊢ ∨ = (join‘𝐾)
cdleme24.m	⊢ ∧ = (meet‘𝐾)
cdleme24.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme24.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme24.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme24.f	⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme24.n	⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊)))

Assertion

Ref	Expression
cdleme25b	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))

Distinct variable groups:   𝑢,𝑠,𝐴   𝐵,𝑠,𝑢   𝐻,𝑠   ∨ ,𝑠,𝑢   𝐾,𝑠   ≤ ,𝑠,𝑢   ∧ ,𝑠,𝑢   𝑃,𝑠,𝑢   𝑄,𝑠,𝑢   𝑅,𝑠,𝑢   𝑊,𝑠,𝑢   𝑢,𝑁   𝑈,𝑠,𝑢

Allowed substitution hints:   𝐹(𝑢,𝑠)   𝐻(𝑢)   𝐾(𝑢)   𝑁(𝑠)

Proof of Theorem cdleme25b

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cdleme24.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		cdleme24.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		cdleme24.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		cdleme24.m	. . 3 ⊢ ∧ = (meet‘𝐾)
5		cdleme24.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
6		cdleme24.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdleme24.u	. . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
8		cdleme24.f	. . 3 ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
9		cdleme24.n	. . 3 ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊)))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	cdleme25a 38294	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵))
11		eqid 2738	. . 3 ⊢ ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
12		eqid 2738	. . 3 ⊢ ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12	cdleme24 38293	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))))
14		breq1 5073	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝑠 ≤ 𝑊 ↔ 𝑡 ≤ 𝑊))
15	14	notbid 317	. . . . 5 ⊢ (𝑠 = 𝑡 → (¬ 𝑠 ≤ 𝑊 ↔ ¬ 𝑡 ≤ 𝑊))
16		breq1 5073	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑡 ≤ (𝑃 ∨ 𝑄)))
17	16	notbid 317	. . . . 5 ⊢ (𝑠 = 𝑡 → (¬ 𝑠 ≤ (𝑃 ∨ 𝑄) ↔ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)))
18	15, 17	anbi12d 630	. . . 4 ⊢ (𝑠 = 𝑡 → ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ↔ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))))
19		oveq1 7262	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑠 ∨ 𝑈) = (𝑡 ∨ 𝑈))
20		oveq2 7263	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑡 → (𝑃 ∨ 𝑠) = (𝑃 ∨ 𝑡))
21	20	oveq1d 7270	. . . . . . . . . 10 ⊢ (𝑠 = 𝑡 → ((𝑃 ∨ 𝑠) ∧ 𝑊) = ((𝑃 ∨ 𝑡) ∧ 𝑊))
22	21	oveq2d 7271	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)) = (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
23	19, 22	oveq12d 7273	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
24	8, 23	syl5eq 2791	. . . . . . 7 ⊢ (𝑠 = 𝑡 → 𝐹 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
25		oveq2 7263	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → (𝑅 ∨ 𝑠) = (𝑅 ∨ 𝑡))
26	25	oveq1d 7270	. . . . . . 7 ⊢ (𝑠 = 𝑡 → ((𝑅 ∨ 𝑠) ∧ 𝑊) = ((𝑅 ∨ 𝑡) ∧ 𝑊))
27	24, 26	oveq12d 7273	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊)) = (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
28	27	oveq2d 7271	. . . . 5 ⊢ (𝑠 = 𝑡 → ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))
29	9, 28	syl5eq 2791	. . . 4 ⊢ (𝑠 = 𝑡 → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))
30	18, 29	reusv3 5323	. . 3 ⊢ (∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵) → (∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))) ↔ ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)))
31	30	biimpd 228	. 2 ⊢ (∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵) → (∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)))
32	10, 13, 31	sylc 65	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  ∃wrex 3064   class class class wbr 5070  ‘cfv 6418  (class class class)co 7255  Basecbs 16840  lecple 16895  joincjn 17944  meetcmee 17945  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-3or 1086  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-iin 4924  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-mpo 7260  df-1st 7804  df-2nd 7805  df-proset 17928  df-poset 17946  df-plt 17963  df-lub 17979  df-glb 17980  df-join 17981  df-meet 17982  df-p0 18058  df-p1 18059  df-lat 18065  df-clat 18132  df-oposet 37117  df-ol 37119  df-oml 37120  df-covers 37207  df-ats 37208  df-atl 37239  df-cvlat 37263  df-hlat 37292  df-llines 37439  df-lplanes 37440  df-lvols 37441  df-lines 37442  df-psubsp 37444  df-pmap 37445  df-padd 37737  df-lhyp 37929

This theorem is referenced by:  cdleme25c  38296