![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfima3 | Structured version Visualization version GIF version |
Description: Alternate definition of image. Compare definition (d) of [Enderton] p. 44. (Contributed by NM, 14-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
dfima3 | ⊢ (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfima2 6061 | . 2 ⊢ (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐴𝑦} | |
2 | df-br 5149 | . . . . 5 ⊢ (𝑥𝐴𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴) | |
3 | 2 | rexbii 3094 | . . . 4 ⊢ (∃𝑥 ∈ 𝐵 𝑥𝐴𝑦 ↔ ∃𝑥 ∈ 𝐵 ⟨𝑥, 𝑦⟩ ∈ 𝐴) |
4 | df-rex 3071 | . . . 4 ⊢ (∃𝑥 ∈ 𝐵 ⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)) | |
5 | 3, 4 | bitri 274 | . . 3 ⊢ (∃𝑥 ∈ 𝐵 𝑥𝐴𝑦 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)) |
6 | 5 | abbii 2802 | . 2 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐴𝑦} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)} |
7 | 1, 6 | eqtri 2760 | 1 ⊢ (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 {cab 2709 ∃wrex 3070 ⟨cop 4634 class class class wbr 5148 “ cima 5679 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-xp 5682 df-cnv 5684 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 |
This theorem is referenced by: imadmrn 6069 imassrn 6070 imai 6073 funimaexgOLD 6635 cnvimadfsn 8156 rdglim2 8431 fineqvrep 34090 dfhe3 42516 |
Copyright terms: Public domain | W3C validator |