| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dmxpOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of dmxp 5908 as of 19-Dec-2024. (Contributed by NM, 28-Jul-1995.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dmxpOLD | ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-xp 5660 | . . 3 ⊢ (𝐴 × 𝐵) = {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} | |
| 2 | 1 | dmeqi 5884 | . 2 ⊢ dom (𝐴 × 𝐵) = dom {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} |
| 3 | n0 4328 | . . . . 5 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
| 4 | 3 | biimpi 216 | . . . 4 ⊢ (𝐵 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐵) |
| 5 | 4 | ralrimivw 3136 | . . 3 ⊢ (𝐵 ≠ ∅ → ∀𝑦 ∈ 𝐴 ∃𝑥 𝑥 ∈ 𝐵) |
| 6 | dmopab3 5899 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∃𝑥 𝑥 ∈ 𝐵 ↔ dom {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} = 𝐴) | |
| 7 | 5, 6 | sylib 218 | . 2 ⊢ (𝐵 ≠ ∅ → dom {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)} = 𝐴) |
| 8 | 2, 7 | eqtrid 2782 | 1 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ≠ wne 2932 ∀wral 3051 ∅c0 4308 {copab 5181 × cxp 5652 dom cdm 5654 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-br 5120 df-opab 5182 df-xp 5660 df-dm 5664 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |