Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fnmptfvd | Structured version Visualization version GIF version |
Description: A function with a given domain is a mapping defined by its function values. (Contributed by AV, 1-Mar-2019.) |
Ref | Expression |
---|---|
fnmptfvd.m | ⊢ (𝜑 → 𝑀 Fn 𝐴) |
fnmptfvd.s | ⊢ (𝑖 = 𝑎 → 𝐷 = 𝐶) |
fnmptfvd.d | ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → 𝐷 ∈ 𝑈) |
fnmptfvd.c | ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐶 ∈ 𝑉) |
Ref | Expression |
---|---|
fnmptfvd | ⊢ (𝜑 → (𝑀 = (𝑎 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnmptfvd.m | . . 3 ⊢ (𝜑 → 𝑀 Fn 𝐴) | |
2 | fnmptfvd.c | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐶 ∈ 𝑉) | |
3 | 2 | ralrimiva 2949 | . . . 4 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 𝐶 ∈ 𝑉) |
4 | eqid 2610 | . . . . 5 ⊢ (𝑎 ∈ 𝐴 ↦ 𝐶) = (𝑎 ∈ 𝐴 ↦ 𝐶) | |
5 | 4 | fnmpt 5933 | . . . 4 ⊢ (∀𝑎 ∈ 𝐴 𝐶 ∈ 𝑉 → (𝑎 ∈ 𝐴 ↦ 𝐶) Fn 𝐴) |
6 | 3, 5 | syl 17 | . . 3 ⊢ (𝜑 → (𝑎 ∈ 𝐴 ↦ 𝐶) Fn 𝐴) |
7 | eqfnfv 6219 | . . 3 ⊢ ((𝑀 Fn 𝐴 ∧ (𝑎 ∈ 𝐴 ↦ 𝐶) Fn 𝐴) → (𝑀 = (𝑎 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = ((𝑎 ∈ 𝐴 ↦ 𝐶)‘𝑖))) | |
8 | 1, 6, 7 | syl2anc 691 | . 2 ⊢ (𝜑 → (𝑀 = (𝑎 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = ((𝑎 ∈ 𝐴 ↦ 𝐶)‘𝑖))) |
9 | fnmptfvd.s | . . . . . . . 8 ⊢ (𝑖 = 𝑎 → 𝐷 = 𝐶) | |
10 | 9 | cbvmptv 4678 | . . . . . . 7 ⊢ (𝑖 ∈ 𝐴 ↦ 𝐷) = (𝑎 ∈ 𝐴 ↦ 𝐶) |
11 | 10 | eqcomi 2619 | . . . . . 6 ⊢ (𝑎 ∈ 𝐴 ↦ 𝐶) = (𝑖 ∈ 𝐴 ↦ 𝐷) |
12 | 11 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑎 ∈ 𝐴 ↦ 𝐶) = (𝑖 ∈ 𝐴 ↦ 𝐷)) |
13 | 12 | fveq1d 6105 | . . . 4 ⊢ (𝜑 → ((𝑎 ∈ 𝐴 ↦ 𝐶)‘𝑖) = ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖)) |
14 | 13 | eqeq2d 2620 | . . 3 ⊢ (𝜑 → ((𝑀‘𝑖) = ((𝑎 ∈ 𝐴 ↦ 𝐶)‘𝑖) ↔ (𝑀‘𝑖) = ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖))) |
15 | 14 | ralbidv 2969 | . 2 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = ((𝑎 ∈ 𝐴 ↦ 𝐶)‘𝑖) ↔ ∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖))) |
16 | simpr 476 | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → 𝑖 ∈ 𝐴) | |
17 | fnmptfvd.d | . . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → 𝐷 ∈ 𝑈) | |
18 | eqid 2610 | . . . . . 6 ⊢ (𝑖 ∈ 𝐴 ↦ 𝐷) = (𝑖 ∈ 𝐴 ↦ 𝐷) | |
19 | 18 | fvmpt2 6200 | . . . . 5 ⊢ ((𝑖 ∈ 𝐴 ∧ 𝐷 ∈ 𝑈) → ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖) = 𝐷) |
20 | 16, 17, 19 | syl2anc 691 | . . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖) = 𝐷) |
21 | 20 | eqeq2d 2620 | . . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴) → ((𝑀‘𝑖) = ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖) ↔ (𝑀‘𝑖) = 𝐷)) |
22 | 21 | ralbidva 2968 | . 2 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = ((𝑖 ∈ 𝐴 ↦ 𝐷)‘𝑖) ↔ ∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = 𝐷)) |
23 | 8, 15, 22 | 3bitrd 293 | 1 ⊢ (𝜑 → (𝑀 = (𝑎 ∈ 𝐴 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 (𝑀‘𝑖) = 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ↦ cmpt 4643 Fn wfn 5799 ‘cfv 5804 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-fv 5812 |
This theorem is referenced by: cramerlem1 20312 dssmapnvod 37334 |
Copyright terms: Public domain | W3C validator |