| 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 6875 | . . 3 ⊢ (¬ 𝑇 ∈ V → ran 𝑆 = ∅) |
| 4 | 1, 3 | nsyl2 142 | . 2 ⊢ (𝐹 ∈ ran 𝑆 → 𝑇 ∈ V) |
| 5 | eqid 2763 | . . . . 5 ⊢ (mVR‘𝑇) = (mVR‘𝑇) | |
| 6 | eqid 2763 | . . . . 5 ⊢ (mREx‘𝑇) = (mREx‘𝑇) | |
| 7 | 5, 6, 2 | mrsubff 36012 | . . . 4 ⊢ (𝑇 ∈ V → 𝑆:((mREx‘𝑇) ↑pm (mVR‘𝑇))⟶((mREx‘𝑇) ↑m (mREx‘𝑇))) |
| 8 | ffun 6708 | . . . 4 ⊢ (𝑆:((mREx‘𝑇) ↑pm (mVR‘𝑇))⟶((mREx‘𝑇) ↑m (mREx‘𝑇)) → Fun 𝑆) | |
| 9 | 4, 7, 8 | 3syl 19 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → Fun 𝑆) |
| 10 | 5, 6, 2 | mrsubrn 36013 | . . . . 5 ⊢ ran 𝑆 = (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇))) |
| 11 | 10 | eleq2i 2855 | . . . 4 ⊢ (𝐹 ∈ ran 𝑆 ↔ 𝐹 ∈ (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇)))) |
| 12 | 11 | biimpi 219 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → 𝐹 ∈ (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇)))) |
| 13 | fvelima 6946 | . . 3 ⊢ ((Fun 𝑆 ∧ 𝐹 ∈ (𝑆 “ ((mREx‘𝑇) ↑m (mVR‘𝑇)))) → ∃𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹) | |
| 14 | 9, 12, 13 | syl2anc 595 | . 2 ⊢ (𝐹 ∈ ran 𝑆 → ∃𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹) |
| 15 | elmapi 8842 | . . . . . . 7 ⊢ (𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇)) → 𝑓:(mVR‘𝑇)⟶(mREx‘𝑇)) | |
| 16 | 15 | adantl 486 | . . . . . 6 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → 𝑓:(mVR‘𝑇)⟶(mREx‘𝑇)) |
| 17 | ssidd 3960 | . . . . . 6 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → (mVR‘𝑇) ⊆ (mVR‘𝑇)) | |
| 18 | wrd0 14581 | . . . . . . 7 ⊢ ∅ ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) | |
| 19 | eqid 2763 | . . . . . . . . 9 ⊢ (mCN‘𝑇) = (mCN‘𝑇) | |
| 20 | 19, 5, 6 | mrexval 36001 | . . . . . . . 8 ⊢ (𝑇 ∈ V → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) |
| 21 | 20 | adantr 485 | . . . . . . 7 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) |
| 22 | 18, 21 | eleqtrrid 2870 | . . . . . 6 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ∅ ∈ (mREx‘𝑇)) |
| 23 | eqid 2763 | . . . . . . 7 ⊢ (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) = (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) | |
| 24 | 19, 5, 6, 2, 23 | mrsubval 36009 | . . . . . 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 6262 | . . . . . . 7 ⊢ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅) = ∅ | |
| 27 | 26 | oveq2i 7421 | . . . . . 6 ⊢ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅)) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ∅) |
| 28 | 23 | frmd0 18923 | . . . . . . 7 ⊢ ∅ = (0g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))) |
| 29 | 28 | gsum0 18746 | . . . . . 6 ⊢ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ∅) = ∅ |
| 30 | 27, 29 | eqtri 2786 | . . . . 5 ⊢ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σg ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), 〈“𝑣”〉)) ∘ ∅)) = ∅ |
| 31 | 25, 30 | eqtrdi 2814 | . . . 4 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ((𝑆‘𝑓)‘∅) = ∅) |
| 32 | fveq1 6880 | . . . . 5 ⊢ ((𝑆‘𝑓) = 𝐹 → ((𝑆‘𝑓)‘∅) = (𝐹‘∅)) | |
| 33 | 32 | eqeq1d 2765 | . . . 4 ⊢ ((𝑆‘𝑓) = 𝐹 → (((𝑆‘𝑓)‘∅) = ∅ ↔ (𝐹‘∅) = ∅)) |
| 34 | 31, 33 | syl5ibcom 248 | . . 3 ⊢ ((𝑇 ∈ V ∧ 𝑓 ∈ ((mREx‘𝑇) ↑m (mVR‘𝑇))) → ((𝑆‘𝑓) = 𝐹 → (𝐹‘∅) = ∅)) |
| 35 | 34 | rexlimdva 3166 | . 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 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 Vcvv 3455 ∪ cun 3903 ⊆ wss 3905 ∅c0 4286 ifcif 4487 ↦ cmpt 5192 ran crn 5662 “ cima 5664 ∘ ccom 5665 Fun wfun 6530 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ↑m cmap 8820 ↑pm cpm 8821 Word cword 14555 〈“cs1 14638 Σg cgsu 17497 freeMndcfrmd 18910 mCNcmcn 35960 mVRcmvar 35961 mRExcmrex 35966 mRSubstcmrsub 35970 |
| This proof depends on 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-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 |
| This proof 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-nel 3065 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-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 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-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 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-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9930 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-2 12307 df-n0 12509 df-z 12596 df-uz 12867 df-fz 13540 df-fzo 13688 df-seq 14043 df-hash 14372 df-word 14556 df-concat 14613 df-s1 14639 df-struct 17211 df-sets 17228 df-slot 17246 df-ndx 17258 df-base 17274 df-ress 17295 df-plusg 17327 df-0g 17498 df-gsum 17499 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-submnd 18846 df-frmd 18912 df-mrex 35986 df-mrsub 35990 |
| This theorem is used by: mrsubvrs 36022 |
| Copyright terms: Public domain | W3C validator |