Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > fmptdF | Structured version Visualization version GIF version |
Description: Domain and codomain of the mapping operation; deduction form. This version of fmptd 6878 uses bound-variable hypothesis instead of distinct variable conditions. (Contributed by Thierry Arnoux, 28-Mar-2017.) |
Ref | Expression |
---|---|
fmptdF.p | ⊢ Ⅎ𝑥𝜑 |
fmptdF.a | ⊢ Ⅎ𝑥𝐴 |
fmptdF.c | ⊢ Ⅎ𝑥𝐶 |
fmptdF.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝐶) |
fmptdF.2 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
Ref | Expression |
---|---|
fmptdF | ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fmptdF.1 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝐶) | |
2 | 1 | sbimi 2079 | . . . . 5 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) → [𝑦 / 𝑥]𝐵 ∈ 𝐶) |
3 | sban 2086 | . . . . . 6 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝑥 ∈ 𝐴)) | |
4 | fmptdF.p | . . . . . . . 8 ⊢ Ⅎ𝑥𝜑 | |
5 | 4 | sbf 2271 | . . . . . . 7 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜑) |
6 | fmptdF.a | . . . . . . . 8 ⊢ Ⅎ𝑥𝐴 | |
7 | 6 | clelsb3fw 2981 | . . . . . . 7 ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) |
8 | 5, 7 | anbi12i 628 | . . . . . 6 ⊢ (([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑦 ∈ 𝐴)) |
9 | 3, 8 | bitri 277 | . . . . 5 ⊢ ([𝑦 / 𝑥](𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑦 ∈ 𝐴)) |
10 | sbsbc 3776 | . . . . . 6 ⊢ ([𝑦 / 𝑥]𝐵 ∈ 𝐶 ↔ [𝑦 / 𝑥]𝐵 ∈ 𝐶) | |
11 | sbcel12 4360 | . . . . . . 7 ⊢ ([𝑦 / 𝑥]𝐵 ∈ 𝐶 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ ⦋𝑦 / 𝑥⦌𝐶) | |
12 | vex 3497 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
13 | fmptdF.c | . . . . . . . . 9 ⊢ Ⅎ𝑥𝐶 | |
14 | 12, 13 | csbgfi 3903 | . . . . . . . 8 ⊢ ⦋𝑦 / 𝑥⦌𝐶 = 𝐶 |
15 | 14 | eleq2i 2904 | . . . . . . 7 ⊢ (⦋𝑦 / 𝑥⦌𝐵 ∈ ⦋𝑦 / 𝑥⦌𝐶 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝐶) |
16 | 11, 15 | bitri 277 | . . . . . 6 ⊢ ([𝑦 / 𝑥]𝐵 ∈ 𝐶 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝐶) |
17 | 10, 16 | bitri 277 | . . . . 5 ⊢ ([𝑦 / 𝑥]𝐵 ∈ 𝐶 ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝐶) |
18 | 2, 9, 17 | 3imtr3i 293 | . . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝐶) |
19 | 18 | ralrimiva 3182 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝐶) |
20 | nfcv 2977 | . . . . 5 ⊢ Ⅎ𝑦𝐴 | |
21 | nfcv 2977 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
22 | nfcsb1v 3907 | . . . . 5 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 | |
23 | csbeq1a 3897 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) | |
24 | 6, 20, 21, 22, 23 | cbvmptf 5165 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵) |
25 | 24 | fmpt 6874 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 ∈ 𝐶 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝐶) |
26 | 19, 25 | sylib 220 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝐶) |
27 | fmptdF.2 | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
28 | 27 | feq1i 6505 | . 2 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶𝐶) |
29 | 26, 28 | sylibr 236 | 1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 [wsb 2069 ∈ wcel 2114 Ⅎwnfc 2961 ∀wral 3138 [wsbc 3772 ⦋csb 3883 ↦ cmpt 5146 ⟶wf 6351 |
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 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-fal 1550 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-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fv 6363 |
This theorem is referenced by: fmptcof2 30402 esumcl 31289 esumid 31303 esumgsum 31304 esumval 31305 esumel 31306 esumsplit 31312 esumaddf 31320 esumss 31331 esumpfinvalf 31335 |
Copyright terms: Public domain | W3C validator |