| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme17d | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 114, first part of 4th paragraph. We show, in their notation, fs(p)=q. TODO FIX COMMENT. (Contributed by NM, 11-Apr-2013.) |
| Ref | Expression |
|---|---|
| cdlemef46.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemef46.l | ⊢ ≤ = (le‘𝐾) |
| cdlemef46.j | ⊢ ∨ = (join‘𝐾) |
| cdlemef46.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemef46.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemef46.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemef46.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdlemef46.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
| cdlemefs46.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
| cdlemef46.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| Ref | Expression |
|---|---|
| cdleme17d | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐹‘𝑃) = 𝑄) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemef46.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemef46.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemef46.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemef46.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemef46.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemef46.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemef46.u | . . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 8 | cdlemef46.d | . . 3 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
| 9 | cdlemefs46.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
| 10 | cdlemef46.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdleme17d4 40477 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄) → (𝐹‘𝑃) = 𝑄) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdleme17d3 40476 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝐹‘𝑃) = 𝑄) |
| 13 | 11, 12 | pm2.61dane 3028 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐹‘𝑃) = 𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ≠ wne 2939 ∀wral 3060 ⦋csb 3898 ifcif 4524 class class class wbr 5141 ↦ cmpt 5223 ‘cfv 6559 ℩crio 7385 (class class class)co 7429 Basecbs 17243 lecple 17300 joincjn 18353 meetcmee 18354 Atomscatm 39242 HLchlt 39329 LHypclh 39964 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5277 ax-sep 5294 ax-nul 5304 ax-pow 5363 ax-pr 5430 ax-un 7751 ax-riotaBAD 38932 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4906 df-iun 4991 df-iin 4992 df-br 5142 df-opab 5204 df-mpt 5224 df-id 5576 df-xp 5689 df-rel 5690 df-cnv 5691 df-co 5692 df-dm 5693 df-rn 5694 df-res 5695 df-ima 5696 df-iota 6512 df-fun 6561 df-fn 6562 df-f 6563 df-f1 6564 df-fo 6565 df-f1o 6566 df-fv 6567 df-riota 7386 df-ov 7432 df-oprab 7433 df-mpo 7434 df-1st 8010 df-2nd 8011 df-undef 8294 df-proset 18336 df-poset 18355 df-plt 18371 df-lub 18387 df-glb 18388 df-join 18389 df-meet 18390 df-p0 18466 df-p1 18467 df-lat 18473 df-clat 18540 df-oposet 39155 df-ol 39157 df-oml 39158 df-covers 39245 df-ats 39246 df-atl 39277 df-cvlat 39301 df-hlat 39330 df-llines 39478 df-lplanes 39479 df-lvols 39480 df-lines 39481 df-psubsp 39483 df-pmap 39484 df-padd 39776 df-lhyp 39968 |
| This theorem is referenced by: cdleme50ex 40539 cdlemg1a 40550 |
| Copyright terms: Public domain | W3C validator |