| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvmpti | Structured version Visualization version GIF version | ||
| Description: Value of a function given in maps-to notation. (Contributed by Mario Carneiro, 23-Apr-2014.) |
| Ref | Expression |
|---|---|
| fvmptg.1 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
| fvmptg.2 | ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) |
| Ref | Expression |
|---|---|
| fvmpti | ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = ( I ‘𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvmptg.1 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 2 | fvmptg.2 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 3 | 1, 2 | fvmptg 6984 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ V) → (𝐹‘𝐴) = 𝐶) |
| 4 | fvi 6954 | . . . 4 ⊢ (𝐶 ∈ V → ( I ‘𝐶) = 𝐶) | |
| 5 | 4 | adantl 487 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ V) → ( I ‘𝐶) = 𝐶) |
| 6 | 3, 5 | eqtr4d 2798 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ V) → (𝐹‘𝐴) = ( I ‘𝐶)) |
| 7 | 1 | eleq1d 2845 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V)) |
| 8 | 2 | dmmpt 6236 | . . . . . . . 8 ⊢ dom 𝐹 = {𝑥 ∈ 𝐷 ∣ 𝐵 ∈ V} |
| 9 | 7, 8 | elrab2 3649 | . . . . . . 7 ⊢ (𝐴 ∈ dom 𝐹 ↔ (𝐴 ∈ 𝐷 ∧ 𝐶 ∈ V)) |
| 10 | 9 | baib 545 | . . . . . 6 ⊢ (𝐴 ∈ 𝐷 → (𝐴 ∈ dom 𝐹 ↔ 𝐶 ∈ V)) |
| 11 | 10 | notbid 321 | . . . . 5 ⊢ (𝐴 ∈ 𝐷 → (¬ 𝐴 ∈ dom 𝐹 ↔ ¬ 𝐶 ∈ V)) |
| 12 | ndmfv 6910 | . . . . 5 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅) | |
| 13 | 11, 12 | biimtrrdi 257 | . . . 4 ⊢ (𝐴 ∈ 𝐷 → (¬ 𝐶 ∈ V → (𝐹‘𝐴) = ∅)) |
| 14 | 13 | imp 412 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ ¬ 𝐶 ∈ V) → (𝐹‘𝐴) = ∅) |
| 15 | fvprc 6870 | . . . 4 ⊢ (¬ 𝐶 ∈ V → ( I ‘𝐶) = ∅) | |
| 16 | 15 | adantl 487 | . . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ ¬ 𝐶 ∈ V) → ( I ‘𝐶) = ∅) |
| 17 | 14, 16 | eqtr4d 2798 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ ¬ 𝐶 ∈ V) → (𝐹‘𝐴) = ( I ‘𝐶)) |
| 18 | 6, 17 | pm2.61dan 825 | 1 ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = ( I ‘𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∅c0 4279 ↦ cmpt 5186 I cid 5549 dom cdm 5655 ‘cfv 6533 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fv 6541 |
| This theorem is used by: fvmpt2i 6997 fvmptex 7001 sumeq2ii 15780 summolem3 15800 fsumf1o 15809 isumshft 15928 prodeq2ii 16000 prodmolem3 16020 fprodf1o 16033 |
| Copyright terms: Public domain | W3C validator |