Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fmpt2d | Structured version Visualization version GIF version |
Description: Domain and codomain of the mapping operation; deduction form. (Contributed by NM, 27-Dec-2014.) |
Ref | Expression |
---|---|
fmpt2d.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) |
fmpt2d.1 | ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
fmpt2d.3 | ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ 𝐶) |
Ref | Expression |
---|---|
fmpt2d | ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fmpt2d.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉) | |
2 | 1 | ralrimiva 3182 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉) |
3 | eqid 2821 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
4 | 3 | fnmpt 6474 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴) |
5 | 2, 4 | syl 17 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴) |
6 | fmpt2d.1 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
7 | 6 | fneq1d 6432 | . . 3 ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)) |
8 | 5, 7 | mpbird 259 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
9 | fmpt2d.3 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ 𝐶) | |
10 | 9 | ralrimiva 3182 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐶) |
11 | ffnfv 6868 | . 2 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐶)) | |
12 | 8, 10, 11 | sylanbrc 585 | 1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ↦ cmpt 5132 Fn wfn 6336 ⟶wf 6337 ‘cfv 6341 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5189 ax-nul 5196 ax-pr 5316 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3488 df-sbc 3764 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-nul 4280 df-if 4454 df-sn 4554 df-pr 4556 df-op 4560 df-uni 4825 df-br 5053 df-opab 5115 df-mpt 5133 df-id 5446 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-fv 6349 |
This theorem is referenced by: cantnff 9123 limsupgre 14823 idaf 17306 curfcl 17465 mat2pmatf 21319 m2cpmf 21333 pm2mpf 21389 clsf 21639 kgenf 22132 lgamf 25605 vmaf 25682 lgsdchr 25917 mirf 26432 suppovss 30412 omsf 31561 erdszelem6 32450 cdleme50f 37710 dochfN 38524 binomcxplemdvsum 40777 |
Copyright terms: Public domain | W3C validator |