Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mrsubcn | Structured version Visualization version GIF version |
Description: A substitution does not change the value of constant substrings. (Contributed by Mario Carneiro, 18-Jul-2016.) |
Ref | Expression |
---|---|
mrsubccat.s | ⊢ 𝑆 = (mRSubst‘𝑇) |
mrsubccat.r | ⊢ 𝑅 = (mREx‘𝑇) |
mrsubcn.v | ⊢ 𝑉 = (mVR‘𝑇) |
mrsubcn.c | ⊢ 𝐶 = (mCN‘𝑇) |
Ref | Expression |
---|---|
mrsubcn | ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝑋 ∈ (𝐶 ∖ 𝑉)) → (𝐹‘〈“𝑋”〉) = 〈“𝑋”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0i 3920 | . . . . 5 ⊢ (𝐹 ∈ ran 𝑆 → ¬ ran 𝑆 = ∅) | |
2 | mrsubccat.s | . . . . . . . 8 ⊢ 𝑆 = (mRSubst‘𝑇) | |
3 | fvprc 6185 | . . . . . . . 8 ⊢ (¬ 𝑇 ∈ V → (mRSubst‘𝑇) = ∅) | |
4 | 2, 3 | syl5eq 2668 | . . . . . . 7 ⊢ (¬ 𝑇 ∈ V → 𝑆 = ∅) |
5 | 4 | rneqd 5353 | . . . . . 6 ⊢ (¬ 𝑇 ∈ V → ran 𝑆 = ran ∅) |
6 | rn0 5377 | . . . . . 6 ⊢ ran ∅ = ∅ | |
7 | 5, 6 | syl6eq 2672 | . . . . 5 ⊢ (¬ 𝑇 ∈ V → ran 𝑆 = ∅) |
8 | 1, 7 | nsyl2 142 | . . . 4 ⊢ (𝐹 ∈ ran 𝑆 → 𝑇 ∈ V) |
9 | mrsubcn.v | . . . . 5 ⊢ 𝑉 = (mVR‘𝑇) | |
10 | mrsubccat.r | . . . . 5 ⊢ 𝑅 = (mREx‘𝑇) | |
11 | 9, 10, 2 | mrsubff 31409 | . . . 4 ⊢ (𝑇 ∈ V → 𝑆:(𝑅 ↑pm 𝑉)⟶(𝑅 ↑𝑚 𝑅)) |
12 | ffun 6048 | . . . 4 ⊢ (𝑆:(𝑅 ↑pm 𝑉)⟶(𝑅 ↑𝑚 𝑅) → Fun 𝑆) | |
13 | 8, 11, 12 | 3syl 18 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → Fun 𝑆) |
14 | 9, 10, 2 | mrsubrn 31410 | . . . . 5 ⊢ ran 𝑆 = (𝑆 “ (𝑅 ↑𝑚 𝑉)) |
15 | 14 | eleq2i 2693 | . . . 4 ⊢ (𝐹 ∈ ran 𝑆 ↔ 𝐹 ∈ (𝑆 “ (𝑅 ↑𝑚 𝑉))) |
16 | 15 | biimpi 206 | . . 3 ⊢ (𝐹 ∈ ran 𝑆 → 𝐹 ∈ (𝑆 “ (𝑅 ↑𝑚 𝑉))) |
17 | fvelima 6248 | . . 3 ⊢ ((Fun 𝑆 ∧ 𝐹 ∈ (𝑆 “ (𝑅 ↑𝑚 𝑉))) → ∃𝑓 ∈ (𝑅 ↑𝑚 𝑉)(𝑆‘𝑓) = 𝐹) | |
18 | 13, 16, 17 | syl2anc 693 | . 2 ⊢ (𝐹 ∈ ran 𝑆 → ∃𝑓 ∈ (𝑅 ↑𝑚 𝑉)(𝑆‘𝑓) = 𝐹) |
19 | elmapi 7879 | . . . . . . 7 ⊢ (𝑓 ∈ (𝑅 ↑𝑚 𝑉) → 𝑓:𝑉⟶𝑅) | |
20 | 19 | adantl 482 | . . . . . 6 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → 𝑓:𝑉⟶𝑅) |
21 | ssid 3624 | . . . . . . 7 ⊢ 𝑉 ⊆ 𝑉 | |
22 | 21 | a1i 11 | . . . . . 6 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → 𝑉 ⊆ 𝑉) |
23 | eldifi 3732 | . . . . . . . 8 ⊢ (𝑋 ∈ (𝐶 ∖ 𝑉) → 𝑋 ∈ 𝐶) | |
24 | elun1 3780 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝐶 → 𝑋 ∈ (𝐶 ∪ 𝑉)) | |
25 | 23, 24 | syl 17 | . . . . . . 7 ⊢ (𝑋 ∈ (𝐶 ∖ 𝑉) → 𝑋 ∈ (𝐶 ∪ 𝑉)) |
26 | 25 | adantr 481 | . . . . . 6 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → 𝑋 ∈ (𝐶 ∪ 𝑉)) |
27 | mrsubcn.c | . . . . . . 7 ⊢ 𝐶 = (mCN‘𝑇) | |
28 | 27, 9, 10, 2 | mrsubcv 31407 | . . . . . 6 ⊢ ((𝑓:𝑉⟶𝑅 ∧ 𝑉 ⊆ 𝑉 ∧ 𝑋 ∈ (𝐶 ∪ 𝑉)) → ((𝑆‘𝑓)‘〈“𝑋”〉) = if(𝑋 ∈ 𝑉, (𝑓‘𝑋), 〈“𝑋”〉)) |
29 | 20, 22, 26, 28 | syl3anc 1326 | . . . . 5 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → ((𝑆‘𝑓)‘〈“𝑋”〉) = if(𝑋 ∈ 𝑉, (𝑓‘𝑋), 〈“𝑋”〉)) |
30 | eldifn 3733 | . . . . . . 7 ⊢ (𝑋 ∈ (𝐶 ∖ 𝑉) → ¬ 𝑋 ∈ 𝑉) | |
31 | 30 | adantr 481 | . . . . . 6 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → ¬ 𝑋 ∈ 𝑉) |
32 | 31 | iffalsed 4097 | . . . . 5 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → if(𝑋 ∈ 𝑉, (𝑓‘𝑋), 〈“𝑋”〉) = 〈“𝑋”〉) |
33 | 29, 32 | eqtrd 2656 | . . . 4 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → ((𝑆‘𝑓)‘〈“𝑋”〉) = 〈“𝑋”〉) |
34 | fveq1 6190 | . . . . 5 ⊢ ((𝑆‘𝑓) = 𝐹 → ((𝑆‘𝑓)‘〈“𝑋”〉) = (𝐹‘〈“𝑋”〉)) | |
35 | 34 | eqeq1d 2624 | . . . 4 ⊢ ((𝑆‘𝑓) = 𝐹 → (((𝑆‘𝑓)‘〈“𝑋”〉) = 〈“𝑋”〉 ↔ (𝐹‘〈“𝑋”〉) = 〈“𝑋”〉)) |
36 | 33, 35 | syl5ibcom 235 | . . 3 ⊢ ((𝑋 ∈ (𝐶 ∖ 𝑉) ∧ 𝑓 ∈ (𝑅 ↑𝑚 𝑉)) → ((𝑆‘𝑓) = 𝐹 → (𝐹‘〈“𝑋”〉) = 〈“𝑋”〉)) |
37 | 36 | rexlimdva 3031 | . 2 ⊢ (𝑋 ∈ (𝐶 ∖ 𝑉) → (∃𝑓 ∈ (𝑅 ↑𝑚 𝑉)(𝑆‘𝑓) = 𝐹 → (𝐹‘〈“𝑋”〉) = 〈“𝑋”〉)) |
38 | 18, 37 | mpan9 486 | 1 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝑋 ∈ (𝐶 ∖ 𝑉)) → (𝐹‘〈“𝑋”〉) = 〈“𝑋”〉) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 Vcvv 3200 ∖ cdif 3571 ∪ cun 3572 ⊆ wss 3574 ∅c0 3915 ifcif 4086 ran crn 5115 “ cima 5117 Fun wfun 5882 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↑𝑚 cmap 7857 ↑pm cpm 7858 〈“cs1 13294 mCNcmcn 31357 mVRcmvar 31358 mRExcmrex 31363 mRSubstcmrsub 31367 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-seq 12802 df-hash 13118 df-word 13299 df-concat 13301 df-s1 13302 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-0g 16102 df-gsum 16103 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-frmd 17386 df-mrex 31383 df-mrsub 31387 |
This theorem is referenced by: elmrsubrn 31417 mrsubco 31418 mrsubvrs 31419 |
Copyright terms: Public domain | W3C validator |