![]() |
Metamath
Proof Explorer Theorem List (p. 404 of 491) | < Previous Next > |
Bad symbols? Try the
GIF version. |
||
Mirrors > Metamath Home Page > MPE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Color key: | ![]() (1-30946) |
![]() (30947-32469) |
![]() (32470-49035) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | cdleme20k 40301 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 114, antepenultimate line. 𝐷, 𝐹, 𝑌, 𝐺 represent s2, f(s), t2, f(t). (Contributed by NM, 20-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝐹 ∨ 𝐷) ≠ (𝑃 ∨ 𝑄)) | ||
Theorem | cdleme20l1 40302 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 114, penultimate line. 𝐷, 𝐹, 𝑌, 𝐺 represent s2, f(s), t2, f(t) respectively. (Contributed by NM, 20-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝐹 ∨ 𝐷) ∈ (LLines‘𝐾)) | ||
Theorem | cdleme20l2 40303 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 114, penultimate line. 𝐷, 𝐹, 𝑌, 𝐺 represent s2, f(s), t2, f(t) respectively. (Contributed by NM, 20-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑅 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇)))) → ((𝐹 ∨ 𝐷) ∧ (𝐺 ∨ 𝑌)) ∈ 𝐴) | ||
Theorem | cdleme20l 40304 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 114, penultimate line. 𝐷, 𝐹, 𝑌, 𝐺 represent s2, f(s), t2, f(t) respectively. (Contributed by NM, 20-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑅 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇)))) → ((𝐹 ∨ 𝐷) ∧ (𝐺 ∨ 𝑌)) = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷))) | ||
Theorem | cdleme20m 40305 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 114, penultimate line. 𝐷, 𝐹, 𝑁, 𝑌, 𝐺, 𝑂 represent s2, f(s), fs(r), t2, f(t), ft(r) respectively. We prove that if ¬ r ≤ s ∨ t and ¬ u ≤ s ∨ t, then fs(r) = ft(r). (Contributed by NM, 20-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑅 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇)))) → 𝑁 = 𝑂) | ||
Theorem | cdleme20 40306 | Combine cdleme19f 40290 and cdleme20m 40305 to eliminate ¬ 𝑅 ≤ (𝑆 ∨ 𝑇) condition. (Contributed by NM, 28-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇))) → 𝑁 = 𝑂) | ||
Theorem | cdleme21a 40307 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 28-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → 𝑆 ≠ 𝑧) | ||
Theorem | cdleme21b 40308 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 28-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) | ||
Theorem | cdleme21c 40309 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 28-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → ¬ 𝑈 ≤ (𝑆 ∨ 𝑧)) | ||
Theorem | cdleme21at 40310 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → 𝑇 ≠ 𝑧) | ||
Theorem | cdleme21ct 40311 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇))) ∧ ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → ¬ 𝑈 ≤ (𝑇 ∨ 𝑧)) | ||
Theorem | cdleme21d 40312 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 115, 3rd line. 𝐷, 𝐹, 𝑁, 𝐸, 𝐵, 𝑍 represent s2, f(s), fs(r), z2, f(z), fz(r) respectively. We prove fs(r) = fz(r). (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐵 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝐸 = ((𝑅 ∨ 𝑧) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑍 = ((𝑃 ∨ 𝑄) ∧ (𝐵 ∨ 𝐸)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))) → 𝑁 = 𝑍) | ||
Theorem | cdleme21e 40313 | Part of proof of Lemma E in [Crawley] p. 113, last paragraph on p. 115, 3rd line. 𝑌, 𝐺, 𝑂, 𝐸, 𝐵, 𝑍 represent s2, f(s), fs(r), z2, f(z), fz(r) respectively. We prove that if u ≤ s ∨ z, then ft(r) = fz(r). (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐵 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝐸 = ((𝑅 ∨ 𝑧) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑍 = ((𝑃 ∨ 𝑄) ∧ (𝐵 ∨ 𝐸)) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))) → 𝑂 = 𝑍) | ||
Theorem | cdleme21f 40314 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐵 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝐸 = ((𝑅 ∨ 𝑧) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑍 = ((𝑃 ∨ 𝑄) ∧ (𝐵 ∨ 𝐸)) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))) → 𝑁 = 𝑂) | ||
Theorem | cdleme21g 40315 | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))) → 𝑁 = 𝑂) | ||
Theorem | cdleme21h 40316* | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)))) → (∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)) → 𝑁 = 𝑂)) | ||
Theorem | cdleme21i 40317* | Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)))) → (∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) → 𝑁 = 𝑂)) | ||
Theorem | cdleme21j 40318* | Combine cdleme20 40306 and cdleme21i 40317 to eliminate 𝑈 ≤ (𝑆 ∨ 𝑇) condition. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑁 = 𝑂) | ||
Theorem | cdleme21 40319 | Part of proof of Lemma E in [Crawley] p. 113, 3rd line on p. 115. 𝐷, 𝐹, 𝑁, 𝑌, 𝐺, 𝑂 represent s2, f(s), fs(r), t2, f(t), ft(r) respectively. Combine cdleme18d 40277 and cdleme21j 40318 to eliminate existence condition, proving fs(r) = ft(r) with fewer conditions. (Contributed by NM, 29-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))) → 𝑁 = 𝑂) | ||
Theorem | cdleme21k 40320 | Eliminate 𝑆 ≠ 𝑇 condition in cdleme21 40319. (Contributed by NM, 26-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) & ⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐷)) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)))) → 𝑁 = 𝑂) | ||
Theorem | cdleme22aa 40321 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 3rd line on p. 115. Show that t ∨ v = p ∨ q implies v = u. (Contributed by NM, 2-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊 ∧ 𝑉 ≤ (𝑃 ∨ 𝑄))) → 𝑉 = 𝑈) | ||
Theorem | cdleme22a 40322 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 3rd line on p. 115. Show that t ∨ v = p ∨ q implies v = u. (Contributed by NM, 30-Nov-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ ((𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊) ∧ 𝑃 ≠ 𝑄 ∧ (𝑇 ∨ 𝑉) = (𝑃 ∨ 𝑄))) → 𝑉 = 𝑈) | ||
Theorem | cdleme22b 40323 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 5th line on p. 115. Show that t ∨ v =/= p ∨ q and s ≤ p ∨ q implies ¬ t ≤ p ∨ q. (Contributed by NM, 2-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ (((𝐾 ∈ HL ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑆 ≠ 𝑇)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑉 ∈ 𝐴 ∧ ((𝑇 ∨ 𝑉) ≠ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑇 ∨ 𝑉) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄)))) → ¬ 𝑇 ≤ (𝑃 ∨ 𝑄)) | ||
Theorem | cdleme22cN 40324 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 5th line on p. 115. Show that t ∨ v =/= p ∨ q and s ≤ p ∨ q implies ¬ v ≤ p ∨ q. (Contributed by NM, 3-Dec-2012.) (New usage is discouraged.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇) ∧ (𝑆 ≤ (𝑇 ∨ 𝑉) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑇 ∨ 𝑉) ≠ (𝑃 ∨ 𝑄))) → ¬ 𝑉 ≤ (𝑃 ∨ 𝑄)) | ||
Theorem | cdleme22d 40325 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 9th line on p. 115. (Contributed by NM, 4-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊)) ∧ (𝑆 ≠ 𝑇 ∧ 𝑆 ≤ (𝑇 ∨ 𝑉))) → 𝑉 = ((𝑆 ∨ 𝑇) ∧ 𝑊)) | ||
Theorem | cdleme22e 40326 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 4th line on p. 115. 𝐹, 𝑁, 𝑂 represent f(z), fz(s), fz(t) respectively. When t ∨ v = p ∨ q, fz(s) ≤ fz(t) ∨ v. (Contributed by NM, 6-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑇 ∨ 𝑧) ∧ 𝑊))) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴)) ∧ ((𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ (𝑇 ∨ 𝑉) = (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊))) → 𝑁 ≤ (𝑂 ∨ 𝑉)) | ||
Theorem | cdleme22eALTN 40327 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 4th line on p. 115. 𝐹, 𝑁, 𝑂 represent f(z), fz(s), fz(t) respectively. When t ∨ v = p ∨ q, fz(s) ≤ fz(t) ∨ v. (Contributed by NM, 6-Dec-2012.) (New usage is discouraged.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑦 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑦) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑦) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ ((𝑇 ∨ 𝑧) ∧ 𝑊))) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ 𝑇 ∈ 𝐴) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑃 ≠ 𝑄) ∧ (𝑆 ∈ 𝐴 ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊 ∧ (𝑇 ∨ 𝑉) = (𝑃 ∨ 𝑄)) ∧ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ≤ 𝑊) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊)))) → 𝑁 ≤ (𝑂 ∨ 𝑉)) | ||
Theorem | cdleme22f 40328 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 6th and 7th lines on p. 115. 𝐹, 𝑁 represent f(t), ft(s) respectively. If s ≤ t ∨ v, then ft(s) ≤ f(t) ∨ v. (Contributed by NM, 6-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑇) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑇 ∈ 𝐴 ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊)) ∧ (𝑆 ≠ 𝑇 ∧ 𝑆 ≤ (𝑇 ∨ 𝑉))) → 𝑁 ≤ (𝐹 ∨ 𝑉)) | ||
Theorem | cdleme22f2 40329 | Part of proof of Lemma E in [Crawley] p. 113. cdleme22f 40328 with s and t swapped (this case is not mentioned by them). If s ≤ t ∨ v, then f(s) ≤ fs(t) ∨ v. (Contributed by NM, 7-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑇 ∨ 𝑆) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ≠ 𝑇 ∧ 𝑆 ≤ (𝑇 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐹 ≤ (𝑁 ∨ 𝑉)) | ||
Theorem | cdleme22g 40330 | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 6th and 7th lines on p. 115. 𝐹, 𝐺 represent f(s), f(t) respectively. If s ≤ t ∨ v and ¬ s ≤ p ∨ q, then f(s) ≤ f(t) ∨ v. (Contributed by NM, 6-Dec-2012.) |
⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ≠ 𝑇 ∧ 𝑆 ≤ (𝑇 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐹 ≤ (𝐺 ∨ 𝑉)) | ||
Theorem | cdleme23a 40331 | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 8-Dec-2012.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ (𝑋 ∧ 𝑊)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑆 ≠ 𝑇 ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑇 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → 𝑉 ≤ 𝑊) | ||
Theorem | cdleme23b 40332 | Part of proof of Lemma E in [Crawley] p. 113, 4th paragraph, 6th line on p. 115. (Contributed by NM, 8-Dec-2012.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ (𝑋 ∧ 𝑊)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑆 ≠ 𝑇 ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑇 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → 𝑉 ∈ 𝐴) | ||
Theorem | cdleme23c 40333 | Part of proof of Lemma E in [Crawley] p. 113, 4th paragraph, 6th line on p. 115. (Contributed by NM, 8-Dec-2012.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑉 = ((𝑆 ∨ 𝑇) ∧ (𝑋 ∧ 𝑊)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑆 ≠ 𝑇 ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑇 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → 𝑆 ≤ (𝑇 ∨ 𝑉)) | ||
Theorem | cdleme24 40334* | Quantified version of cdleme21k 40320. (Contributed by NM, 26-Dec-2012.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄))) → 𝑁 = 𝑂)) | ||
Theorem | cdleme25a 40335* | Lemma for cdleme25b 40336. (Contributed by NM, 1-Jan-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑁 ∈ 𝐵)) | ||
Theorem | cdleme25b 40336* | Transform cdleme24 40334. TODO get rid of $d's on 𝑈, 𝑁 (Contributed by NM, 1-Jan-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) | ||
Theorem | cdleme25c 40337* | Transform cdleme25b 40336. (Contributed by NM, 1-Jan-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃!𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) | ||
Theorem | cdleme25dN 40338* | Transform cdleme25c 40337. (Contributed by NM, 19-Jan-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ∃!𝑢 ∈ 𝐵 ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑢 = 𝑁)) | ||
Theorem | cdleme25cl 40339* | Show closure of the unique element in cdleme25c 40337. (Contributed by NM, 2-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → 𝐼 ∈ 𝐵) | ||
Theorem | cdleme25cv 40340* | Change bound variables in cdleme25c 40337. (Contributed by NM, 2-Feb-2013.) |
⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ ((𝑅 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) ⇒ ⊢ 𝐼 = 𝐸 | ||
Theorem | cdleme26e 40341* | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 4th line on p. 115. 𝐹, 𝑁, 𝑂 represent f(z), fz(s), fz(t) respectively. When t ∨ v = p ∨ q, fz(s) ≤ fz(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 2-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑇 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) ∧ ((𝑇 ∨ 𝑉) = (𝑃 ∨ 𝑄) ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊))) → 𝐼 ≤ (𝐸 ∨ 𝑉)) | ||
Theorem | cdleme26ee 40342* | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 4th line on p. 115. 𝐹, 𝑁, 𝑂 represent f(z), fz(s), fz(t) respectively. When t ∨ v = p ∨ q, fz(s) ≤ fz(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 2-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑇 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑇 ∨ 𝑉) = (𝑃 ∨ 𝑄))) → 𝐼 ≤ (𝐸 ∨ 𝑉)) | ||
Theorem | cdleme26eALTN 40343* | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 4th line on p. 115. 𝐹, 𝑁, 𝑂 represent f(z), fz(s), fz(t) respectively. When t ∨ v = p ∨ q, fz(s) ≤ fz(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 1-Feb-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑦 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑦) ∧ 𝑊))) & ⊢ 𝐺 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑦) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ ((𝑇 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑦 ∈ 𝐴 ((¬ 𝑦 ≤ 𝑊 ∧ ¬ 𝑦 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊 ∧ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄))) ∧ ((𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊 ∧ (𝑇 ∨ 𝑉) = (𝑃 ∨ 𝑄)) ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ≤ 𝑊 ∧ ¬ 𝑦 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)))) → 𝐼 ≤ (𝐸 ∨ 𝑉)) | ||
Theorem | cdleme26fALTN 40344* | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 6th and 7th lines on p. 115. 𝐹, 𝑁 represent f(t), ft(s) respectively. If t ≤ t ∨ v, then ft(s) ≤ f(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 1-Feb-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑆 ≠ 𝑡 ∧ 𝑆 ≤ (𝑡 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐼 ≤ (𝐹 ∨ 𝑉)) | ||
Theorem | cdleme26f 40345* | Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph, 6th and 7th lines on p. 115. 𝐹, 𝑁 represent f(t), ft(s) respectively. If t ≤ t ∨ v, then ft(s) ≤ f(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 1-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑆 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑡 ≤ (𝑃 ∨ 𝑄) ∧ (𝑆 ≠ 𝑡 ∧ 𝑆 ≤ (𝑡 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐼 ≤ (𝐹 ∨ 𝑉)) | ||
Theorem | cdleme26f2ALTN 40346* | Part of proof of Lemma E in [Crawley] p. 113. cdleme26fALTN 40344 with s and t swapped (this case is not mentioned by them). If s ≤ t ∨ v, then f(s) ≤ fs(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 1-Feb-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐺 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ ((𝑇 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ≠ 𝑇 ∧ 𝑠 ≤ (𝑇 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐺 ≤ (𝐸 ∨ 𝑉)) | ||
Theorem | cdleme26f2 40347* | Part of proof of Lemma E in [Crawley] p. 113. cdleme26fALTN 40344 with s and t swapped (this case is not mentioned by them). If s ≤ t ∨ v, then f(s) ≤ fs(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 1-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐺 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝐺 ∨ ((𝑇 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊)) ∧ (¬ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ (𝑠 ≠ 𝑇 ∧ 𝑠 ≤ (𝑇 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐺 ≤ (𝐸 ∨ 𝑉)) | ||
Theorem | cdleme27cl 40348* | Part of proof of Lemma E in [Crawley] p. 113. Closure of 𝐶. (Contributed by NM, 6-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑃 ≠ 𝑄)) → 𝐶 ∈ 𝐵) | ||
Theorem | cdleme27a 40349* | Part of proof of Lemma E in [Crawley] p. 113. cdleme26f 40345 with s and t swapped (this case is not mentioned by them). If s ≤ t ∨ v, then f(s) ≤ fs(t) ∨ v. TODO: FIX COMMENT. (Contributed by NM, 3-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ ((𝑠 ≠ 𝑡 ∧ 𝑠 ≤ (𝑡 ∨ 𝑉)) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐶 ≤ (𝑌 ∨ 𝑉)) | ||
Theorem | cdleme27b 40350* | Lemma for cdleme27N 40351. (Contributed by NM, 3-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) ⇒ ⊢ (𝑠 = 𝑡 → 𝐶 = 𝑌) | ||
Theorem | cdleme27N 40351* | Part of proof of Lemma E in [Crawley] p. 113. Eliminate the 𝑠 ≠ 𝑡 antecedent in cdleme27a 40349. (Contributed by NM, 3-Feb-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ (𝑠 ≤ (𝑡 ∨ 𝑉) ∧ (𝑉 ∈ 𝐴 ∧ 𝑉 ≤ 𝑊))) → 𝐶 ≤ (𝑌 ∨ 𝑉)) | ||
Theorem | cdleme28a 40352* | Lemma for cdleme25b 40336. TODO: FIX COMMENT. (Contributed by NM, 4-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) & ⊢ 𝑉 = ((𝑠 ∨ 𝑡) ∧ (𝑋 ∧ 𝑊)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ (𝑠 ≠ 𝑡 ∧ ((𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))) → (𝐶 ∨ (𝑋 ∧ 𝑊)) ≤ (𝑌 ∨ (𝑋 ∧ 𝑊))) | ||
Theorem | cdleme28b 40353* | Lemma for cdleme25b 40336. TODO: FIX COMMENT. (Contributed by NM, 6-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ (𝑠 ≠ 𝑡 ∧ ((𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊))) | ||
Theorem | cdleme28c 40354* | Part of proof of Lemma E in [Crawley] p. 113. Eliminate the 𝑠 ≠ 𝑡 antecedent in cdleme28b 40353. TODO: FIX COMMENT. (Contributed by NM, 6-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ (𝑡 ∈ 𝐴 ∧ ¬ 𝑡 ≤ 𝑊)) ∧ ((𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊))) | ||
Theorem | cdleme28 40355* | Quantified version of cdleme28c 40354. (Compare cdleme24 40334.) (Contributed by NM, 7-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)) & ⊢ 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (¬ 𝑡 ≤ 𝑊 ∧ (𝑡 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐶 ∨ (𝑋 ∧ 𝑊)) = (𝑌 ∨ (𝑋 ∧ 𝑊)))) | ||
Theorem | cdleme29ex 40356* | Lemma for cdleme29b 40357. (Compare cdleme25a 40335.) TODO: FIX COMMENT. (Contributed by NM, 7-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵)) | ||
Theorem | cdleme29b 40357* | Transform cdleme28 40355. (Compare cdleme25b 40336.) TODO: FIX COMMENT. (Contributed by NM, 7-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃𝑣 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑣 = (𝐶 ∨ (𝑋 ∧ 𝑊)))) | ||
Theorem | cdleme29c 40358* | Transform cdleme28b 40353. (Compare cdleme25c 40337.) TODO: FIX COMMENT. (Contributed by NM, 8-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ∃!𝑣 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑣 = (𝐶 ∨ (𝑋 ∧ 𝑊)))) | ||
Theorem | cdleme29cl 40359* | Show closure of the unique element in cdleme28c 40354. (Contributed by NM, 8-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) & ⊢ 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) & ⊢ 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) & ⊢ 𝐼 = (℩𝑣 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑣 = (𝐶 ∨ (𝑋 ∧ 𝑊)))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝐼 ∈ 𝐵) | ||
Theorem | cdleme30a 40360 | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 9-Feb-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑠 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ 𝑌 ∈ 𝐵) ∧ ((𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋 ∧ 𝑋 ≤ 𝑌)) → (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌) | ||
Theorem | cdleme31so 40361* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 25-Feb-2013.) |
⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐶 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))) ⇒ ⊢ (𝑋 ∈ 𝐵 → ⦋𝑋 / 𝑥⦌𝑂 = 𝐶) | ||
Theorem | cdleme31sn 40362* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.) |
⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) & ⊢ 𝐶 = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷) ⇒ ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) | ||
Theorem | cdleme31sn1 40363* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.) |
⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) & ⊢ 𝐶 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = ⦋𝑅 / 𝑠⦌𝐺)) ⇒ ⊢ ((𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) | ||
Theorem | cdleme31se 40364* | Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.) |
⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑇) ∧ 𝑊))) & ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑇) ∧ 𝑊))) ⇒ ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝐸 = 𝑌) | ||
Theorem | cdleme31se2 40365* | Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 3-Apr-2013.) |
⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) ⇒ ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌) | ||
Theorem | cdleme31sc 40366* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 31-Mar-2013.) |
⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑋 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊))) ⇒ ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝐶 = 𝑋) | ||
Theorem | cdleme31sde 40367* | Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 31-Mar-2013.) |
⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑌 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) & ⊢ 𝑍 = ((𝑃 ∨ 𝑄) ∧ (𝑌 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) ⇒ ⊢ ((𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → ⦋𝑅 / 𝑠⦌⦋𝑆 / 𝑡⦌𝐸 = 𝑍) | ||
Theorem | cdleme31snd 40368* | Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 1-Apr-2013.) |
⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑂 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑂) ∧ 𝑊))) & ⊢ 𝑂 = ((𝑆 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑆) ∧ 𝑊))) ⇒ ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑣⦌⦋𝑁 / 𝑡⦌𝐷 = 𝐸) | ||
Theorem | cdleme31sdnN 40369* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 31-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, ⦋𝑠 / 𝑡⦌𝐷) | ||
Theorem | cdleme31sn1c 40370* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 1-Mar-2013.) |
⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) & ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐶 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝑌)) ⇒ ⊢ ((𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) | ||
Theorem | cdleme31sn2 40371* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.) |
⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) & ⊢ 𝐶 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊))) ⇒ ⊢ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) | ||
Theorem | cdleme31fv 40372* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 10-Feb-2013.) |
⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) & ⊢ 𝐶 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))) ⇒ ⊢ (𝑋 ∈ 𝐵 → (𝐹‘𝑋) = if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋)) | ||
Theorem | cdleme31fv1 40373* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 10-Feb-2013.) |
⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) & ⊢ 𝐶 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))) ⇒ ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝐶) | ||
Theorem | cdleme31fv1s 40374* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 25-Feb-2013.) |
⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) ⇒ ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = ⦋𝑋 / 𝑥⦌𝑂) | ||
Theorem | cdleme31fv2 40375* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 23-Feb-2013.) |
⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) ⇒ ⊢ ((𝑋 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐹‘𝑋) = 𝑋) | ||
Theorem | cdleme31id 40376* | Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 18-Apr-2013.) |
⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) ⇒ ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑃 = 𝑄) → (𝐹‘𝑋) = 𝑋) | ||
Theorem | cdlemefrs29pre00 40377 | ***START OF VALUE AT ATOM STUFF TO REPLACE ONES BELOW*** FIX COMMENT. TODO: see if this is the optimal utility theorem using lhpmat 40012. (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ 𝜓) ∧ 𝑠 ∈ 𝐴) → (((¬ 𝑠 ≤ 𝑊 ∧ 𝜑) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) ↔ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅))) | ||
Theorem | cdlemefrs29bpre0 40378* | TODO fix comment. (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝜑))) → 𝑁 ∈ 𝐵) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → (∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝜑) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊))) ↔ 𝑧 = ⦋𝑅 / 𝑠⦌𝑁)) | ||
Theorem | cdlemefrs29bpre1 40379* | TODO: FIX COMMENT. (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝜑))) → 𝑁 ∈ 𝐵) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ∃𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝜑) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊)))) | ||
Theorem | cdlemefrs29cpre1 40380* | TODO: FIX COMMENT. (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝜑))) → 𝑁 ∈ 𝐵) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ∃!𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝜑) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊)))) | ||
Theorem | cdlemefrs29clN 40381* | TODO: NOT USED? Show closure of the unique element in cdlemefrs29cpre1 40380. (Contributed by NM, 29-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝜑))) → 𝑁 ∈ 𝐵) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊)))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → 𝑂 ∈ 𝐵) | ||
Theorem | cdlemefrs32fva 40382* | Part of proof of Lemma E in [Crawley] p. 113. Value of 𝐹 at an atom not under 𝑊. TODO: FIX COMMENT. TODO: consolidate uses of lhpmat 40012 here and elsewhere, and presence/absence of 𝑠 ≤ (𝑃 ∨ 𝑄) term. Also, why can proof be shortened with cdleme29cl 40359? What is difference from cdlemefs27cl 40395? (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝜑))) → 𝑁 ∈ 𝐵) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ⦋𝑅 / 𝑥⦌𝑂 = ⦋𝑅 / 𝑠⦌𝑁) | ||
Theorem | cdlemefrs32fva1 40383* | Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ (𝑠 = 𝑅 → (𝜑 ↔ 𝜓)) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝜑))) → 𝑁 ∈ 𝐵) & ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝜓) → (𝐹‘𝑅) = ⦋𝑅 / 𝑠⦌𝑁) | ||
Theorem | cdlemefr29exN 40384* | Lemma for cdlemefs29bpre1N 40399. (Compare cdleme25a 40335.) TODO: FIX COMMENT. TODO: IS THIS NEEDED? (Contributed by NM, 28-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ∀𝑠 ∈ 𝐴 𝐶 ∈ 𝐵) → ∃𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) ∧ (𝐶 ∨ (𝑋 ∧ 𝑊)) ∈ 𝐵)) | ||
Theorem | cdlemefr27cl 40385 | Part of proof of Lemma E in [Crawley] p. 113. Closure of 𝑁. (Contributed by NM, 23-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑁 ∈ 𝐵) | ||
Theorem | cdlemefr32sn2aw 40386* | Show that ⦋𝑅 / 𝑠⦌𝑁 is an atom not under 𝑊 when ¬ 𝑅 ≤ (𝑃 ∨ 𝑄). (Contributed by NM, 28-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐴 ∧ ¬ ⦋𝑅 / 𝑠⦌𝑁 ≤ 𝑊)) | ||
Theorem | cdlemefr32snb 40387* | Show closure of ⦋𝑅 / 𝑠⦌𝑁. (Contributed by NM, 28-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) | ||
Theorem | cdlemefr29bpre0N 40388* | TODO fix comment. (Contributed by NM, 28-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ ¬ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊))) ↔ 𝑧 = ⦋𝑅 / 𝑠⦌𝑁)) | ||
Theorem | cdlemefr29clN 40389* | Show closure of the unique element in cdleme29c 40358. TODO fix comment. TODO Not needed? (Contributed by NM, 29-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊)))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑂 ∈ 𝐵) | ||
Theorem | cdleme43frv1snN 40390* | Value of ⦋𝑅 / 𝑠⦌𝑁 when ¬ 𝑅 ≤ (𝑃 ∨ 𝑄). (Contributed by NM, 30-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) & ⊢ 𝑋 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊))) ⇒ ⊢ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 = 𝑋) | ||
Theorem | cdlemefr32fvaN 40391* | Part of proof of Lemma E in [Crawley] p. 113. Value of 𝐹 at an atom not under 𝑊. TODO: FIX COMMENT. (Contributed by NM, 29-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑥⦌𝑂 = ⦋𝑅 / 𝑠⦌𝑁) | ||
Theorem | cdlemefr32fva1 40392* | Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. (Contributed by NM, 29-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝐹‘𝑅) = ⦋𝑅 / 𝑠⦌𝑁) | ||
Theorem | cdlemefr31fv1 40393* | Value of (𝐹‘𝑅) when ¬ 𝑅 ≤ (𝑃 ∨ 𝑄). TODO This may be useful for shortening others that now use riotasv 38940 3d . TODO: FIX COMMENT. (Contributed by NM, 30-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) & ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) & ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)) & ⊢ 𝑋 = ((𝑅 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑅) ∧ 𝑊))) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝐹‘𝑅) = 𝑋) | ||
Theorem | cdlemefs29pre00N 40394 | FIX COMMENT. TODO: see if this is the optimal utility theorem using lhpmat 40012. (Contributed by NM, 27-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑠 ∈ 𝐴) → (((¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) ↔ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅))) | ||
Theorem | cdlemefs27cl 40395* | Part of proof of Lemma E in [Crawley] p. 113. Closure of 𝑁. TODO FIX COMMENT This is the start of a re-proof of cdleme27cl 40348 etc. with the 𝑠 ≤ (𝑃 ∨ 𝑄) condition (so as to not have the 𝐶 hypothesis). (Contributed by NM, 24-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝐸)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑁 ∈ 𝐵) | ||
Theorem | cdlemefs32sn1aw 40396* | Show that ⦋𝑅 / 𝑠⦌𝑁 is an atom not under 𝑊 when 𝑅 ≤ (𝑃 ∨ 𝑄). (Contributed by NM, 24-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) & ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝑍 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝑌)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐴 ∧ ¬ ⦋𝑅 / 𝑠⦌𝑁 ≤ 𝑊)) | ||
Theorem | cdlemefs32snb 40397* | Show closure of ⦋𝑅 / 𝑠⦌𝑁. (Contributed by NM, 24-Mar-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵) | ||
Theorem | cdlemefs29bpre0N 40398* | TODO: FIX COMMENT. (Contributed by NM, 26-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊))) ↔ 𝑧 = ⦋𝑅 / 𝑠⦌𝑁)) | ||
Theorem | cdlemefs29bpre1N 40399* | TODO: FIX COMMENT. (Contributed by NM, 27-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ∃𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊)))) | ||
Theorem | cdlemefs29cpre1N 40400* | TODO: FIX COMMENT. (Contributed by NM, 26-Mar-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) & ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) & ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)) & ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ∃!𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊)))) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |