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 2966 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉) |
3 | eqid 2622 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
4 | 3 | fnmpt 6020 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴) |
5 | 2, 4 | syl 17 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴) |
6 | fmpt2d.1 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
7 | 6 | fneq1d 5981 | . . 3 ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)) |
8 | 5, 7 | mpbird 247 | . 2 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
9 | fmpt2d.3 | . . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ 𝐶) | |
10 | 9 | ralrimiva 2966 | . 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐶) |
11 | ffnfv 6388 | . 2 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐶)) | |
12 | 8, 10, 11 | sylanbrc 698 | 1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ↦ cmpt 4729 Fn wfn 5883 ⟶wf 5884 ‘cfv 5888 |
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-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 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-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 |
This theorem is referenced by: cantnff 8571 limsupgre 14212 idaf 16713 curfcl 16872 yonedainv 16921 mat2pmatf 20533 m2cpmf 20547 pm2mpf 20603 clsf 20852 kgenf 21344 rrxcph 23180 lgamf 24768 vmaf 24845 lgsdchr 25080 mirf 25555 omsf 30358 erdszelem6 31178 cdleme50f 35830 dochfN 36645 binomcxplemdvsum 38554 |
Copyright terms: Public domain | W3C validator |