Theorem cdleme40w 38411

Description: Part of proof of Lemma E in [Crawley] p. 113. Apply cdleme40v 38410 bound variable change to ⦋𝑆 / 𝑢⦌𝑉. TODO: FIX COMMENT. (Contributed by NM, 19-Mar-2013.)

Hypotheses

Ref	Expression
cdleme40.b	⊢ 𝐵 = (Base‘𝐾)
cdleme40.l	⊢ ≤ = (le‘𝐾)
cdleme40.j	⊢ ∨ = (join‘𝐾)
cdleme40.m	⊢ ∧ = (meet‘𝐾)
cdleme40.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme40.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme40.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme40.e	⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme40.g	⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdleme40.i	⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
cdleme40.n	⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
cdleme40.d	⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme40r.y	⊢ 𝑌 = ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))

Assertion

Ref	Expression
cdleme40w	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑅 / 𝑠⦌𝑁 ≠ ⦋𝑆 / 𝑠⦌𝑁)

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

Allowed substitution hints:   𝐷(𝑦,𝑢,𝑡,𝑠)   𝑅(𝑢)   𝐸(𝑢,𝑡)   𝐺(𝑦,𝑢,𝑡,𝑠)   𝐻(𝑢,𝑠)   𝐼(𝑦,𝑢,𝑡,𝑠)   𝐾(𝑢,𝑠)   𝑁(𝑦,𝑡,𝑠)   𝑌(𝑢,𝑡,𝑠)

Proof of Theorem cdleme40w

Dummy variables 𝑣 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cdleme40.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		cdleme40.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		cdleme40.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		cdleme40.m	. . 3 ⊢ ∧ = (meet‘𝐾)
5		cdleme40.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
6		cdleme40.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdleme40.u	. . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
8		cdleme40.e	. . 3 ⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
9		cdleme40.g	. . 3 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
10		cdleme40.i	. . 3 ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
11		cdleme40.n	. . 3 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
12		eqid 2738	. . 3 ⊢ ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
13		eqid 2738	. . 3 ⊢ (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))))) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))))
14		eqid 2738	. . 3 ⊢ ((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) = ((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊)))
15		eqid 2738	. . 3 ⊢ ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑆 ∨ 𝑣) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑆 ∨ 𝑣) ∧ 𝑊)))
16		eqid 2738	. . 3 ⊢ ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
17		eqid 2738	. . 3 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))) = (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))))
18		eqid 2738	. . 3 ⊢ if(𝑢 ≤ (𝑃 ∨ 𝑄), (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))) = if(𝑢 ≤ (𝑃 ∨ 𝑄), (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊))))
19		eqid 2738	. . 3 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑆 ∨ 𝑣) ∧ 𝑊))))) = (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑆 ∨ 𝑣) ∧ 𝑊)))))
20	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19	cdleme40n 38409	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑅 / 𝑠⦌𝑁 ≠ ⦋𝑆 / 𝑢⦌if(𝑢 ≤ (𝑃 ∨ 𝑄), (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))))
21		simp23l 1292	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → 𝑆 ∈ 𝐴)
22		cdleme40.d	. . . 4 ⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
23		eqid 2738	. . . 4 ⊢ ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊))) = ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))
24	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 22, 23, 14, 16, 17, 18	cdleme40v 38410	. . 3 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑠⦌𝑁 = ⦋𝑆 / 𝑢⦌if(𝑢 ≤ (𝑃 ∨ 𝑄), (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))))
25	21, 24	syl 17	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑆 / 𝑠⦌𝑁 = ⦋𝑆 / 𝑢⦌if(𝑢 ≤ (𝑃 ∨ 𝑄), (℩𝑧 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑄)) → 𝑧 = ((𝑃 ∨ 𝑄) ∧ (((𝑣 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ((𝑢 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑢) ∧ 𝑊)))))
26	20, 25	neeqtrrd 3017	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑅 / 𝑠⦌𝑁 ≠ ⦋𝑆 / 𝑠⦌𝑁)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  ⦋csb 3828  ifcif 4456   class class class wbr 5070  ‘cfv 6418  ℩crio 7211  (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  ax-riotaBAD 36894

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-rmo 3071  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-undef 8060  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:  cdleme41snaw  38417