| 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 7708 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 7853 | . . 3 ⊢ ((𝐴 × 𝐵) ∈ V → dom (𝐴 × 𝐵) ∈ V) | |
| 2 | dmxp 5886 | . . . 4 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴) | |
| 3 | 2 | eleq1d 2822 | . . 3 ⊢ (𝐵 ≠ ∅ → (dom (𝐴 × 𝐵) ∈ V ↔ 𝐴 ∈ V)) |
| 4 | 1, 3 | imbitrid 244 | . 2 ⊢ (𝐵 ≠ ∅ → ((𝐴 × 𝐵) ∈ V → 𝐴 ∈ V)) |
| 5 | 4 | imp 406 | 1 ⊢ ((𝐵 ≠ ∅ ∧ (𝐴 × 𝐵) ∈ V) → 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 ≠ wne 2933 Vcvv 3442 ∅c0 4287 × cxp 5630 dom cdm 5632 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-xp 5638 df-cnv 5640 df-dm 5642 df-rn 5643 |
| This theorem is referenced by: fczsupp0 8145 |
| Copyright terms: Public domain | W3C validator |