| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpexcnv | Structured version Visualization version GIF version | ||
| Description: A condition where the converse of xpex 7752 holds as well. Corollary 6.9(2) in [TakeutiZaring] p. 26. (Contributed by Andrew Salmon, 13-Nov-2011.) |
| Ref | Expression |
|---|---|
| xpexcnv | ⊢ ((𝐵 ≠ ∅ ∧ (𝐴 × 𝐵) ∈ V) → 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dmexg 7898 | . . 3 ⊢ ((𝐴 × 𝐵) ∈ V → dom (𝐴 × 𝐵) ∈ V) | |
| 2 | dmxp 5920 | . . . 4 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴) | |
| 3 | 2 | eleq1d 2854 | . . 3 ⊢ (𝐵 ≠ ∅ → (dom (𝐴 × 𝐵) ∈ V ↔ 𝐴 ∈ V)) |
| 4 | 1, 3 | imbitrid 247 | . 2 ⊢ (𝐵 ≠ ∅ → ((𝐴 × 𝐵) ∈ V → 𝐴 ∈ V)) |
| 5 | 4 | imp 411 | 1 ⊢ ((𝐵 ≠ ∅ ∧ (𝐴 × 𝐵) ∈ V) → 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2149 ≠ wne 2964 Vcvv 3463 ∅c0 4294 × cxp 5660 dom cdm 5662 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-xp 5668 df-cnv 5670 df-dm 5672 df-rn 5673 |
| This theorem is referenced by: fczsupp0 8189 |
| Copyright terms: Public domain | W3C validator |