Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapfzcons2 | Structured version Visualization version GIF version |
Description: Recover added element from an extended mapping. (Contributed by Stefan O'Rear, 10-Oct-2014.) (Revised by Stefan O'Rear, 5-May-2015.) |
Ref | Expression |
---|---|
mapfzcons.1 | ⊢ 𝑀 = (𝑁 + 1) |
Ref | Expression |
---|---|
mapfzcons2 | ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → ((𝐴 ∪ {〈𝑀, 𝐶〉})‘𝑀) = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mapfzcons.1 | . . . 4 ⊢ 𝑀 = (𝑁 + 1) | |
2 | ovex 6678 | . . . 4 ⊢ (𝑁 + 1) ∈ V | |
3 | 1, 2 | eqeltri 2697 | . . 3 ⊢ 𝑀 ∈ V |
4 | 3 | a1i 11 | . 2 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → 𝑀 ∈ V) |
5 | elex 3212 | . . 3 ⊢ (𝐶 ∈ 𝐵 → 𝐶 ∈ V) | |
6 | 5 | adantl 482 | . 2 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ V) |
7 | elmapi 7879 | . . . . . . 7 ⊢ (𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) → 𝐴:(1...𝑁)⟶𝐵) | |
8 | fdm 6051 | . . . . . . 7 ⊢ (𝐴:(1...𝑁)⟶𝐵 → dom 𝐴 = (1...𝑁)) | |
9 | 7, 8 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) → dom 𝐴 = (1...𝑁)) |
10 | 9 | adantr 481 | . . . . 5 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → dom 𝐴 = (1...𝑁)) |
11 | 10 | ineq1d 3813 | . . . 4 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → (dom 𝐴 ∩ {𝑀}) = ((1...𝑁) ∩ {𝑀})) |
12 | 1 | sneqi 4188 | . . . . . 6 ⊢ {𝑀} = {(𝑁 + 1)} |
13 | 12 | ineq2i 3811 | . . . . 5 ⊢ ((1...𝑁) ∩ {𝑀}) = ((1...𝑁) ∩ {(𝑁 + 1)}) |
14 | fzp1disj 12399 | . . . . 5 ⊢ ((1...𝑁) ∩ {(𝑁 + 1)}) = ∅ | |
15 | 13, 14 | eqtri 2644 | . . . 4 ⊢ ((1...𝑁) ∩ {𝑀}) = ∅ |
16 | 11, 15 | syl6eq 2672 | . . 3 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → (dom 𝐴 ∩ {𝑀}) = ∅) |
17 | disjsn 4246 | . . 3 ⊢ ((dom 𝐴 ∩ {𝑀}) = ∅ ↔ ¬ 𝑀 ∈ dom 𝐴) | |
18 | 16, 17 | sylib 208 | . 2 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → ¬ 𝑀 ∈ dom 𝐴) |
19 | fsnunfv 6453 | . 2 ⊢ ((𝑀 ∈ V ∧ 𝐶 ∈ V ∧ ¬ 𝑀 ∈ dom 𝐴) → ((𝐴 ∪ {〈𝑀, 𝐶〉})‘𝑀) = 𝐶) | |
20 | 4, 6, 18, 19 | syl3anc 1326 | 1 ⊢ ((𝐴 ∈ (𝐵 ↑𝑚 (1...𝑁)) ∧ 𝐶 ∈ 𝐵) → ((𝐴 ∪ {〈𝑀, 𝐶〉})‘𝑀) = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ∪ cun 3572 ∩ cin 3573 ∅c0 3915 {csn 4177 〈cop 4183 dom cdm 5114 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↑𝑚 cmap 7857 1c1 9937 + caddc 9939 ...cfz 12326 |
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-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-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-po 5035 df-so 5036 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-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-1st 7168 df-2nd 7169 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-z 11378 df-uz 11688 df-fz 12327 |
This theorem is referenced by: rexrabdioph 37358 |
Copyright terms: Public domain | W3C validator |