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 4313 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
2 | xpsneng 8605 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) | |
3 | 2 | 3adant2 1127 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≈ 𝐴) |
4 | 3 | ensymd 8563 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 × {𝑥})) |
5 | xpexg 7476 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ∈ V) | |
6 | 5 | 3adant3 1128 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × 𝐵) ∈ V) |
7 | simp3 1134 | . . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
8 | 7 | snssd 4745 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
9 | xpss2 5578 | . . . . . . . 8 ⊢ ({𝑥} ⊆ 𝐵 → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) | |
10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵)) |
11 | ssdomg 8558 | . . . . . . 7 ⊢ ((𝐴 × 𝐵) ∈ V → ((𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵))) | |
12 | 6, 10, 11 | sylc 65 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) |
13 | endomtr 8570 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 × {𝑥}) ∧ (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) → 𝐴 ≼ (𝐴 × 𝐵)) | |
14 | 4, 12, 13 | syl2anc 586 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 × 𝐵)) |
15 | 14 | 3expia 1117 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
16 | 15 | exlimdv 1933 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 × 𝐵))) |
17 | 1, 16 | syl5bi 244 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 × 𝐵))) |
18 | 17 | 3impia 1113 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 ∃wex 1779 ∈ wcel 2113 ≠ wne 3019 Vcvv 3497 ⊆ wss 3939 ∅c0 4294 {csn 4570 class class class wbr 5069 × cxp 5556 ≈ cen 8509 ≼ cdom 8510 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-int 4880 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-er 8292 df-en 8513 df-dom 8514 |
This theorem is referenced by: mapdom2 8691 xpfir 8743 infxpabs 9637 |
Copyright terms: Public domain | W3C validator |