Theorem cdleme25b 38368

Description: Transform cdleme24 38366. 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 38367	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵))
11		eqid 2738	. . 3 ⊢ ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
12		eqid 2738	. . 3 ⊢ ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12	cdleme24 38366	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))))
14		breq1 5077	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝑠 ≤ 𝑊 ↔ 𝑡 ≤ 𝑊))
15	14	notbid 318	. . . . 5 ⊢ (𝑠 = 𝑡 → (¬ 𝑠 ≤ 𝑊 ↔ ¬ 𝑡 ≤ 𝑊))
16		breq1 5077	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑡 ≤ (𝑃 ∨ 𝑄)))
17	16	notbid 318	. . . . 5 ⊢ (𝑠 = 𝑡 → (¬ 𝑠 ≤ (𝑃 ∨ 𝑄) ↔ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)))
18	15, 17	anbi12d 631	. . . 4 ⊢ (𝑠 = 𝑡 → ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ↔ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))))
19		oveq1 7282	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑠 ∨ 𝑈) = (𝑡 ∨ 𝑈))
20		oveq2 7283	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑡 → (𝑃 ∨ 𝑠) = (𝑃 ∨ 𝑡))
21	20	oveq1d 7290	. . . . . . . . . 10 ⊢ (𝑠 = 𝑡 → ((𝑃 ∨ 𝑠) ∧ 𝑊) = ((𝑃 ∨ 𝑡) ∧ 𝑊))
22	21	oveq2d 7291	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)) = (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
23	19, 22	oveq12d 7293	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
24	8, 23	eqtrid 2790	. . . . . . 7 ⊢ (𝑠 = 𝑡 → 𝐹 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
25		oveq2 7283	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → (𝑅 ∨ 𝑠) = (𝑅 ∨ 𝑡))
26	25	oveq1d 7290	. . . . . . 7 ⊢ (𝑠 = 𝑡 → ((𝑅 ∨ 𝑠) ∧ 𝑊) = ((𝑅 ∨ 𝑡) ∧ 𝑊))
27	24, 26	oveq12d 7293	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊)) = (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
28	27	oveq2d 7291	. . . . 5 ⊢ (𝑠 = 𝑡 → ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))
29	9, 28	eqtrid 2790	. . . 4 ⊢ (𝑠 = 𝑡 → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))
30	18, 29	reusv3 5328	. . 3 ⊢ (∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵) → (∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))) ↔ ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)))
31	30	biimpd 228	. 2 ⊢ (∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵) → (∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)))
32	10, 13, 31	sylc 65	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3065   class class class wbr 5074  ‘cfv 6433  (class class class)co 7275  Basecbs 16912  lecple 16969  joincjn 18029  meetcmee 18030  Atomscatm 37277  HLchlt 37364  LHypclh 37998

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-proset 18013  df-poset 18031  df-plt 18048  df-lub 18064  df-glb 18065  df-join 18066  df-meet 18067  df-p0 18143  df-p1 18144  df-lat 18150  df-clat 18217  df-oposet 37190  df-ol 37192  df-oml 37193  df-covers 37280  df-ats 37281  df-atl 37312  df-cvlat 37336  df-hlat 37365  df-llines 37512  df-lplanes 37513  df-lvols 37514  df-lines 37515  df-psubsp 37517  df-pmap 37518  df-padd 37810  df-lhyp 38002

This theorem is referenced by:  cdleme25c  38369