| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfima3 | 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 5078 | . 2 ⊢ (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐴𝑦} | |
| 2 | df-br 4089 | . . . . 5 ⊢ (𝑥𝐴𝑦 ↔ 〈𝑥, 𝑦〉 ∈ 𝐴) | |
| 3 | 2 | rexbii 2539 | . . . 4 ⊢ (∃𝑥 ∈ 𝐵 𝑥𝐴𝑦 ↔ ∃𝑥 ∈ 𝐵 〈𝑥, 𝑦〉 ∈ 𝐴) |
| 4 | df-rex 2516 | . . . 4 ⊢ (∃𝑥 ∈ 𝐵 〈𝑥, 𝑦〉 ∈ 𝐴 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 〈𝑥, 𝑦〉 ∈ 𝐴)) | |
| 5 | 3, 4 | bitri 184 | . . 3 ⊢ (∃𝑥 ∈ 𝐵 𝑥𝐴𝑦 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 〈𝑥, 𝑦〉 ∈ 𝐴)) |
| 6 | 5 | abbii 2347 | . 2 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑥𝐴𝑦} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ 〈𝑥, 𝑦〉 ∈ 𝐴)} |
| 7 | 1, 6 | eqtri 2252 | 1 ⊢ (𝐴 “ 𝐵) = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ 〈𝑥, 𝑦〉 ∈ 𝐴)} |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1397 ∃wex 1540 ∈ wcel 2202 {cab 2217 ∃wrex 2511 〈cop 3672 class class class wbr 4088 “ cima 4728 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-br 4089 df-opab 4151 df-xp 4731 df-cnv 4733 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 |
| This theorem is referenced by: imadmrn 5086 imassrn 5087 imai 5092 |
| Copyright terms: Public domain | W3C validator |