Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dmxpm | GIF version |
Description: The domain of a cross product. Part of Theorem 3.13(x) of [Monk1] p. 37. (Contributed by NM, 28-Jul-1995.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
dmxpm | ⊢ (∃𝑥 𝑥 ∈ 𝐵 → dom (𝐴 × 𝐵) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1 2238 | . . 3 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵)) | |
2 | 1 | cbvexv 1916 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐵 ↔ ∃𝑧 𝑧 ∈ 𝐵) |
3 | df-xp 4626 | . . . 4 ⊢ (𝐴 × 𝐵) = {〈𝑦, 𝑧〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)} | |
4 | 3 | dmeqi 4821 | . . 3 ⊢ dom (𝐴 × 𝐵) = dom {〈𝑦, 𝑧〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)} |
5 | id 19 | . . . . 5 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → ∃𝑧 𝑧 ∈ 𝐵) | |
6 | 5 | ralrimivw 2549 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → ∀𝑦 ∈ 𝐴 ∃𝑧 𝑧 ∈ 𝐵) |
7 | dmopab3 4833 | . . . 4 ⊢ (∀𝑦 ∈ 𝐴 ∃𝑧 𝑧 ∈ 𝐵 ↔ dom {〈𝑦, 𝑧〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)} = 𝐴) | |
8 | 6, 7 | sylib 122 | . . 3 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → dom {〈𝑦, 𝑧〉 ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)} = 𝐴) |
9 | 4, 8 | eqtrid 2220 | . 2 ⊢ (∃𝑧 𝑧 ∈ 𝐵 → dom (𝐴 × 𝐵) = 𝐴) |
10 | 2, 9 | sylbi 121 | 1 ⊢ (∃𝑥 𝑥 ∈ 𝐵 → dom (𝐴 × 𝐵) = 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∃wex 1490 ∈ wcel 2146 ∀wral 2453 {copab 4058 × cxp 4618 dom cdm 4620 |
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 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-pow 4169 ax-pr 4203 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1459 df-sb 1761 df-eu 2027 df-mo 2028 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ral 2458 df-v 2737 df-un 3131 df-in 3133 df-ss 3140 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-br 3999 df-opab 4060 df-xp 4626 df-dm 4630 |
This theorem is referenced by: rnxpm 5050 ssxpbm 5056 ssxp1 5057 xpexr2m 5062 relrelss 5147 unixpm 5156 exmidfodomrlemim 7190 |
Copyright terms: Public domain | W3C validator |