| Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mrsub0 | Structured version Visualization version GIF version | ||
| Description: The value of the substituted empty string. (Contributed by Mario Carneiro, 18-Jul-2016.) |
| Ref | Expression |
|---|---|
| mrsubccat.s | ⊢ 𝑆 = (mRSubst‘𝑇) |
| Ref | Expression |
|---|---|
| mrsub0 | ⊢ (𝐹 ∈ ran 𝑆 → (𝐹‘∅) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0i 4293 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → ¬ ran 𝑆 = ∅) | |
| 2 | mrsubccat.s | . . . 4 ⊢ 𝑆 = (mRSubst‘𝑇) | |
| 3 | 2 | rnfvprc 6879 | . . 3 ⊢ (¬ 𝑇 ∈ V → ran 𝑆 = ∅) |
| 4 | 1, 3 | nsyl2 142 | . 2 ⊢ (𝐹 ∈ ran 𝑆 → 𝑇 ∈ V) |
| 5 | eqid 2765 | . . . . 5 ⊢ (mVR‘𝑇) = (mVR‘𝑇) | |
| 6 | eqid 2765 | . . . . 5 ⊢ (mREx‘𝑇) = (mREx‘𝑇) | |
| 7 | 5, 6, 2 | mrsubff 36017 | . . . 4 ⊢ (𝑇 ∈ V → 𝑆:((mREx‘𝑇) ↑pm (mVR‘𝑇))⟶((mREx‘𝑇) ↑m (mREx‘𝑇))) |
| 8 | ffun 6712 | . . . 4 ⊢ (𝑆:((mREx‘𝑇) ↑pm (mVR‘𝑇))⟶((mREx‘𝑇) ↑m (mREx‘𝑇)) → Fun 𝑆) | |
| 9 | 4, 7, 8 | 3syl 19 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → Fun 𝑆) |
| 10 | 5, 6, 2 | mrsubrn 36018 | . . . . 5 ⊢ ran 𝑆 = (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇))) |
| 11 | 10 | eleq2i 2857 | . . . 4 ⊢ (𝐹 ∈ ran 𝑆 ↔ 𝐹 ∈ (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇)))) |
| 12 | 11 | biimpi 219 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → 𝐹 ∈ (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇)))) |
| 13 | fvelima 6950 | . . 3 ⊢ ((Fun 𝑆 ∧ 𝐹 ∈ (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇)))) → ∃𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹) | |
| 14 | 9, 12, 13 | syl2anc 596 | . 2 ⊢ (𝐹 ∈ ran 𝑆 → ∃𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹) |
| 15 | elmapi 8848 | . . . . . . 7 ⊢ (𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇)) → 𝑓:(mVR‘𝑇)⟶(mREx‘𝑇)) | |
| 16 | 15 | adantl 487 | . . . . . 6 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → 𝑓:(mVR‘𝑇)⟶(mREx‘𝑇)) |
| 17 | ssidd 3961 | . . . . . 6 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → (mVR‘𝑇) ⊆ (mVR‘𝑇)) | |
| 18 | wrd0 14589 | . . . . . . 7 ⊢ ∅ ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) | |
| 19 | eqid 2765 | . . . . . . . . 9 ⊢ (mCN‘𝑇) = (mCN‘𝑇) | |
| 20 | 19, 5, 6 | mrexval 36006 | . . . . . . . 8 ⊢ (𝑇 ∈ V → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) |
| 21 | 20 | adantr 486 | . . . . . . 7 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) |
| 22 | 18, 21 | eleqtrrid 2872 | . . . . . 6 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ∅ ∈ (mREx‘𝑇)) |
| 23 | eqid 2765 | . . . . . . 7 ⊢ (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) = (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) | |
| 24 | 19, 5, 6, 2, 23 | mrsubval 36014 | . . . . . 6 ⊢ ((𝑓:(mVR‘𝑇)⟶(mREx‘𝑇) ∧ (mVR‘𝑇) ⊆ (mVR‘𝑇) ∧ ∅ ∈ (mREx‘𝑇)) → ((𝑆‘𝑓)‘∅) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅))) |
| 25 | 16, 17, 22, 24 | syl3anc 1398 | . . . . 5 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ((𝑆‘𝑓)‘∅) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅))) |
| 26 | co02 6264 | . . . . . . 7 ⊢ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅) = ∅ | |
| 27 | 26 | oveq2i 7427 | . . . . . 6 ⊢ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅)) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ∅) |
| 28 | 23 | frmd0 18942 | . . . . . . 7 ⊢ ∅ = (0g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))) |
| 29 | 28 | gsum0 18763 | . . . . . 6 ⊢ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ∅) = ∅ |
| 30 | 27, 29 | eqtri 2788 | . . . . 5 ⊢ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅)) = ∅ |
| 31 | 25, 30 | eqtrdi 2816 | . . . 4 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ((𝑆‘𝑓)‘∅) = ∅) |
| 32 | fveq1 6884 | . . . . 5 ⊢ ((𝑆‘𝑓) = 𝐹 → ((𝑆‘𝑓)‘∅) = (𝐹‘∅)) | |
| 33 | 32 | eqeq1d 2767 | . . . 4 ⊢ ((𝑆‘𝑓) = 𝐹 → (((𝑆‘𝑓)‘∅) = ∅ ↔ (𝐹‘∅) = ∅)) |
| 34 | 31, 33 | syl5ibcom 248 | . . 3 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ((𝑆‘𝑓) = 𝐹 → (𝐹‘∅) = ∅)) |
| 35 | 34 | rexlimdva 3168 | . 2 ⊢ (𝑇 ∈ V → (∃𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹 → (𝐹‘∅) = ∅)) |
| 36 | 4, 14, 35 | sylc 66 | 1 ⊢ (𝐹 ∈ ran 𝑆 → (𝐹‘∅) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 Vcvv 3457 ∪ cun 3904 ⊆ wss 3906 ∅c0 4286 ifcif 4489 ↦ cmpt 5194 ran crn 5664 “ cima 5666 ∘ ccom 5667 Fun wfun 6534 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 ↑m cmap 8826 ↑pm cpm 8827 Word cword 14563 〈“cs1 14647 Σg cgsu 17510 freeMndcfrmd 18929 mCNcmcn 35965 mVRcmvar 35966 mRExcmrex 35971 mRSubstcmrsub 35975 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-map 8828 df-pm 8829 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-card 9937 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-nn 12245 df-2 12314 df-n0 12516 df-z 12603 df-uz 12874 df-fz 13547 df-fzo 13695 df-seq 14051 df-hash 14380 df-word 14564 df-concat 14621 df-s1 14648 df-struct 17224 df-sets 17241 df-slot 17259 df-ndx 17271 df-base 17287 df-ress 17308 df-plusg 17340 df-0g 17511 df-gsum 17512 df-mgm 18715 df-sgrp 18798 df-mnd 18814 df-submnd 18865 df-frmd 18931 df-mrex 35991 df-mrsub 35995 |
| This theorem is used by: mrsubvrs 36027 |
| Copyright terms: Public domain | W3C validator |