| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme50rnlem | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma D in [Crawley] p. 113. TODO: fix comment. TODO: can we get rid of 𝐺 stuff if we show 𝐺 = ◡𝐹 earlier? (Contributed by NM, 9-Apr-2013.) |
| Ref | Expression |
|---|---|
| cdlemef50.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemef50.l | ⊢ ≤ = (le‘𝐾) |
| cdlemef50.j | ⊢ ∨ = (join‘𝐾) |
| cdlemef50.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemef50.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemef50.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemef50.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdlemef50.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
| cdlemefs50.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
| cdlemef50.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| cdlemef50.v | ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊) |
| cdlemef50.n | ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) |
| cdlemefs50.o | ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) |
| cdlemef50.g | ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) |
| Ref | Expression |
|---|---|
| cdleme50rnlem | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ran 𝐹 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemef50.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemef50.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemef50.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemef50.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemef50.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemef50.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemef50.u | . . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 8 | cdlemef50.d | . . . 4 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
| 9 | cdlemefs50.e | . . . 4 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
| 10 | cdlemef50.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdleme50f 41336 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹:𝐵⟶𝐵) |
| 12 | 11 | frnd 6714 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ran 𝐹 ⊆ 𝐵) |
| 13 | cdlemef50.v | . . . . 5 ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊) | |
| 14 | cdlemef50.n | . . . . 5 ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) | |
| 15 | cdlemefs50.o | . . . . 5 ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) | |
| 16 | cdlemef50.g | . . . . 5 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) | |
| 17 | 1, 2, 3, 4, 5, 6, 13, 14, 15, 16 | cdlemeg46fvcl 41300 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑒 ∈ 𝐵) → (𝐺‘𝑒) ∈ 𝐵) |
| 18 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16 | cdleme48fgv 41332 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑒 ∈ 𝐵) → (𝐹‘(𝐺‘𝑒)) = 𝑒) |
| 19 | fveqeq2 6890 | . . . . 5 ⊢ (𝑑 = (𝐺‘𝑒) → ((𝐹‘𝑑) = 𝑒 ↔ (𝐹‘(𝐺‘𝑒)) = 𝑒)) | |
| 20 | 19 | rspcev 3581 | . . . 4 ⊢ (((𝐺‘𝑒) ∈ 𝐵 ∧ (𝐹‘(𝐺‘𝑒)) = 𝑒) → ∃𝑑 ∈ 𝐵 (𝐹‘𝑑) = 𝑒) |
| 21 | 17, 18, 20 | syl2anc 595 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑒 ∈ 𝐵) → ∃𝑑 ∈ 𝐵 (𝐹‘𝑑) = 𝑒) |
| 22 | 11 | adantr 485 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑒 ∈ 𝐵) → 𝐹:𝐵⟶𝐵) |
| 23 | ffn 6705 | . . . 4 ⊢ (𝐹:𝐵⟶𝐵 → 𝐹 Fn 𝐵) | |
| 24 | fvelrnb 6941 | . . . 4 ⊢ (𝐹 Fn 𝐵 → (𝑒 ∈ ran 𝐹 ↔ ∃𝑑 ∈ 𝐵 (𝐹‘𝑑) = 𝑒)) | |
| 25 | 22, 23, 24 | 3syl 19 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑒 ∈ 𝐵) → (𝑒 ∈ ran 𝐹 ↔ ∃𝑑 ∈ 𝐵 (𝐹‘𝑑) = 𝑒)) |
| 26 | 21, 25 | mpbird 260 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑒 ∈ 𝐵) → 𝑒 ∈ ran 𝐹) |
| 27 | 12, 26 | eqelssd 3958 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ran 𝐹 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 ∃wrex 3089 ⦋csb 3853 ifcif 4487 class class class wbr 5109 ↦ cmpt 5192 ran crn 5662 Fn wfn 6531 ⟶wf 6532 ‘cfv 6536 ℩crio 7366 (class class class)co 7410 Basecbs 17264 lecple 17312 joincjn 18362 meetcmee 18363 Atomscatm 40057 HLchlt 40144 LHypclh 40778 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-riotaBAD 39747 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-undef 8265 df-proset 18345 df-poset 18364 df-plt 18379 df-lub 18395 df-glb 18396 df-join 18397 df-meet 18398 df-p0 18474 df-p1 18475 df-lat 18483 df-clat 18550 df-oposet 39970 df-ol 39972 df-oml 39973 df-covers 40060 df-ats 40061 df-atl 40092 df-cvlat 40116 df-hlat 40145 df-llines 40292 df-lplanes 40293 df-lvols 40294 df-lines 40295 df-psubsp 40297 df-pmap 40298 df-padd 40590 df-lhyp 40782 |
| This theorem is referenced by: cdleme50rn 41339 |
| Copyright terms: Public domain | W3C validator |