![]() |
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 4376 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
2 | xpsneng 9122 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) | |
3 | 2 | 3adant2 1131 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) |
4 | 3 | ensymd 9065 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 × {𝑥})) |
5 | xpexg 7785 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ∈ V) | |
6 | 5 | 3adant3 1132 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × 𝐵) ∈ V) |
7 | simp3 1138 | . . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
8 | 7 | snssd 4834 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
9 | xpss2 5720 | . . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐵 → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) | |
10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) |
11 | ssdomg 9060 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ∈ V → ((𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵))) | |
12 | 6, 10, 11 | sylc 65 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) |
13 | endomtr 9072 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 × {𝑥}) ∧ (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) → 𝐴 ≼ (𝐴 × 𝐵)) | |
14 | 4, 12, 13 | syl2anc 583 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 × 𝐵)) |
15 | 14 | 3expia 1121 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
16 | 15 | exlimdv 1932 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
17 | 1, 16 | biimtrid 242 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 × 𝐵))) |
18 | 17 | 3impia 1117 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 Vcvv 3488 ⊆ wss 3976 ∅c0 4352 {csn 4648 class class class wbr 5166 × cxp 5698 ≈ cen 9000 ≼ cdom 9001 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-er 8763 df-en 9004 df-dom 9005 |
This theorem is referenced by: mapdom2 9214 xpfir 9328 infxpabs 10280 |
Copyright terms: Public domain | W3C validator |