| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpdom3 | Structured version Visualization version GIF version | ||
| Description: A set is dominated by its Cartesian product with a nonempty set. Exercise 6 of [Suppes] p. 98. (Contributed by NM, 27-Jul-2004.) (Revised by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| xpdom3 | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4294 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
| 2 | xpsneng 8993 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) | |
| 3 | 2 | 3adant2 1132 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) |
| 4 | 3 | ensymd 8945 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 × {𝑥})) |
| 5 | xpexg 7697 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ∈ V) | |
| 6 | 5 | 3adant3 1133 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × 𝐵) ∈ V) |
| 7 | simp3 1139 | . . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 8 | 7 | snssd 4753 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
| 9 | xpss2 5644 | . . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐵 → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) | |
| 10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) |
| 11 | ssdomg 8940 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ∈ V → ((𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵))) | |
| 12 | 6, 10, 11 | sylc 65 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) |
| 13 | endomtr 8952 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 × {𝑥}) ∧ (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) → 𝐴 ≼ (𝐴 × 𝐵)) | |
| 14 | 4, 12, 13 | syl2anc 585 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 × 𝐵)) |
| 15 | 14 | 3expia 1122 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
| 16 | 15 | exlimdv 1935 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
| 17 | 1, 16 | biimtrid 242 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 × 𝐵))) |
| 18 | 17 | 3impia 1118 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∃wex 1781 ∈ wcel 2114 ≠ wne 2933 Vcvv 3430 ⊆ wss 3890 ∅c0 4274 {csn 4568 class class class wbr 5086 × cxp 5622 ≈ cen 8883 ≼ cdom 8884 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-er 8636 df-en 8887 df-dom 8888 |
| This theorem is referenced by: mapdom2 9079 xpfir 9171 infxpabs 10124 |
| Copyright terms: Public domain | W3C validator |