Theorem cdleme25b 38105

Description: Transform cdleme24 38103. 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 38104	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵))
11		eqid 2737	. . 3 ⊢ ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
12		eqid 2737	. . 3 ⊢ ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12	cdleme24 38103	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))))
14		breq1 5056	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝑠 ≤ 𝑊 ↔ 𝑡 ≤ 𝑊))
15	14	notbid 321	. . . . 5 ⊢ (𝑠 = 𝑡 → (¬ 𝑠 ≤ 𝑊 ↔ ¬ 𝑡 ≤ 𝑊))
16		breq1 5056	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑡 ≤ (𝑃 ∨ 𝑄)))
17	16	notbid 321	. . . . 5 ⊢ (𝑠 = 𝑡 → (¬ 𝑠 ≤ (𝑃 ∨ 𝑄) ↔ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)))
18	15, 17	anbi12d 634	. . . 4 ⊢ (𝑠 = 𝑡 → ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ↔ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))))
19		oveq1 7220	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑠 ∨ 𝑈) = (𝑡 ∨ 𝑈))
20		oveq2 7221	. . . . . . . . . . 11 ⊢ (𝑠 = 𝑡 → (𝑃 ∨ 𝑠) = (𝑃 ∨ 𝑡))
21	20	oveq1d 7228	. . . . . . . . . 10 ⊢ (𝑠 = 𝑡 → ((𝑃 ∨ 𝑠) ∧ 𝑊) = ((𝑃 ∨ 𝑡) ∧ 𝑊))
22	21	oveq2d 7229	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)) = (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
23	19, 22	oveq12d 7231	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
24	8, 23	syl5eq 2790	. . . . . . 7 ⊢ (𝑠 = 𝑡 → 𝐹 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
25		oveq2 7221	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → (𝑅 ∨ 𝑠) = (𝑅 ∨ 𝑡))
26	25	oveq1d 7228	. . . . . . 7 ⊢ (𝑠 = 𝑡 → ((𝑅 ∨ 𝑠) ∧ 𝑊) = ((𝑅 ∨ 𝑡) ∧ 𝑊))
27	24, 26	oveq12d 7231	. . . . . 6 ⊢ (𝑠 = 𝑡 → (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊)) = (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
28	27	oveq2d 7229	. . . . 5 ⊢ (𝑠 = 𝑡 → ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))
29	9, 28	syl5eq 2790	. . . 4 ⊢ (𝑠 = 𝑡 → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))
30	18, 29	reusv3 5298	. . 3 ⊢ (∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵) → (∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))) ↔ ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)))
31	30	biimpd 232	. 2 ⊢ (∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵) → (∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = ((𝑃 ∨ 𝑄) ∧ (((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)))
32	10, 13, 31	sylc 65	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1089   = wceq 1543   ∈ wcel 2110   ≠ wne 2940  ∀wral 3061  ∃wrex 3062   class class class wbr 5053  ‘cfv 6380  (class class class)co 7213  Basecbs 16760  lecple 16809  joincjn 17818  meetcmee 17819  Atomscatm 37014  HLchlt 37101  LHypclh 37735

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5179  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-iun 4906  df-iin 4907  df-br 5054  df-opab 5116  df-mpt 5136  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-riota 7170  df-ov 7216  df-oprab 7217  df-mpo 7218  df-1st 7761  df-2nd 7762  df-proset 17802  df-poset 17820  df-plt 17836  df-lub 17852  df-glb 17853  df-join 17854  df-meet 17855  df-p0 17931  df-p1 17932  df-lat 17938  df-clat 18005  df-oposet 36927  df-ol 36929  df-oml 36930  df-covers 37017  df-ats 37018  df-atl 37049  df-cvlat 37073  df-hlat 37102  df-llines 37249  df-lplanes 37250  df-lvols 37251  df-lines 37252  df-psubsp 37254  df-pmap 37255  df-padd 37547  df-lhyp 37739

This theorem is referenced by:  cdleme25c  38106