Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > feqmptdf | Structured version Visualization version GIF version |
Description: Deduction form of dffn5f 6837. (Contributed by Mario Carneiro, 8-Jan-2015.) (Revised by Thierry Arnoux, 10-May-2017.) |
Ref | Expression |
---|---|
feqmptdf.1 | ⊢ Ⅎ𝑥𝐴 |
feqmptdf.2 | ⊢ Ⅎ𝑥𝐹 |
feqmptdf.3 | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
Ref | Expression |
---|---|
feqmptdf | ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | feqmptdf.3 | . 2 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
2 | ffn 6598 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
3 | fnrel 6533 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → Rel 𝐹) | |
4 | feqmptdf.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐹 | |
5 | nfcv 2909 | . . . . . 6 ⊢ Ⅎ𝑦𝐹 | |
6 | 4, 5 | dfrel4 6093 | . . . . 5 ⊢ (Rel 𝐹 ↔ 𝐹 = {〈𝑥, 𝑦〉 ∣ 𝑥𝐹𝑦}) |
7 | 3, 6 | sylib 217 | . . . 4 ⊢ (𝐹 Fn 𝐴 → 𝐹 = {〈𝑥, 𝑦〉 ∣ 𝑥𝐹𝑦}) |
8 | feqmptdf.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐴 | |
9 | 4, 8 | nffn 6530 | . . . . 5 ⊢ Ⅎ𝑥 𝐹 Fn 𝐴 |
10 | nfv 1921 | . . . . 5 ⊢ Ⅎ𝑦 𝐹 Fn 𝐴 | |
11 | fnbr 6539 | . . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥𝐹𝑦) → 𝑥 ∈ 𝐴) | |
12 | 11 | ex 413 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 → 𝑥 ∈ 𝐴)) |
13 | 12 | pm4.71rd 563 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))) |
14 | eqcom 2747 | . . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦) | |
15 | fnbrfvb 6819 | . . . . . . . 8 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦)) | |
16 | 14, 15 | bitrid 282 | . . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦)) |
17 | 16 | pm5.32da 579 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))) |
18 | 13, 17 | bitr4d 281 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)))) |
19 | 9, 10, 18 | opabbid 5144 | . . . 4 ⊢ (𝐹 Fn 𝐴 → {〈𝑥, 𝑦〉 ∣ 𝑥𝐹𝑦} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))}) |
20 | 7, 19 | eqtrd 2780 | . . 3 ⊢ (𝐹 Fn 𝐴 → 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))}) |
21 | df-mpt 5163 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))} | |
22 | 20, 21 | eqtr4di 2798 | . 2 ⊢ (𝐹 Fn 𝐴 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
23 | 1, 2, 22 | 3syl 18 | 1 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1542 ∈ wcel 2110 Ⅎwnfc 2889 class class class wbr 5079 {copab 5141 ↦ cmpt 5162 Rel wrel 5595 Fn wfn 6427 ⟶wf 6428 ‘cfv 6432 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pr 5356 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ral 3071 df-rex 3072 df-rab 3075 df-v 3433 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5490 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-fv 6440 |
This theorem is referenced by: esumf1o 32014 feqresmptf 42742 liminfvaluz3 43308 liminfvaluz4 43311 volioofmpt 43506 volicofmpt 43509 |
Copyright terms: Public domain | W3C validator |