![]() |
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 3964 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
2 | xpsneng 8086 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) | |
3 | 2 | 3adant2 1100 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) |
4 | 3 | ensymd 8048 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 × {𝑥})) |
5 | xpexg 7002 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ∈ V) | |
6 | 5 | 3adant3 1101 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × 𝐵) ∈ V) |
7 | simp3 1083 | . . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
8 | 7 | snssd 4372 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
9 | xpss2 5162 | . . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐵 → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) | |
10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) |
11 | ssdomg 8043 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ∈ V → ((𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵))) | |
12 | 6, 10, 11 | sylc 65 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) |
13 | endomtr 8055 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 × {𝑥}) ∧ (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) → 𝐴 ≼ (𝐴 × 𝐵)) | |
14 | 4, 12, 13 | syl2anc 694 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 × 𝐵)) |
15 | 14 | 3expia 1286 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
16 | 15 | exlimdv 1901 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
17 | 1, 16 | syl5bi 232 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 × 𝐵))) |
18 | 17 | 3impia 1280 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1054 ∃wex 1744 ∈ wcel 2030 ≠ wne 2823 Vcvv 3231 ⊆ wss 3607 ∅c0 3948 {csn 4210 class class class wbr 4685 × cxp 5141 ≈ cen 7994 ≼ cdom 7995 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-int 4508 df-br 4686 df-opab 4746 df-mpt 4763 df-id 5053 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-er 7787 df-en 7998 df-dom 7999 |
This theorem is referenced by: mapdom2 8172 xpfir 8223 infxpabs 9072 |
Copyright terms: Public domain | W3C validator |