MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xpdom3 Structured version   Visualization version   GIF version

Theorem xpdom3 8403
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.)
Assertion
Ref Expression
xpdom3 ((𝐴𝑉𝐵𝑊𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵))

Proof of Theorem xpdom3
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 n0 4191 . . 3 (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥𝐵)
2 xpsneng 8390 . . . . . . . 8 ((𝐴𝑉𝑥𝐵) → (𝐴 × {𝑥}) ≈ 𝐴)
323adant2 1111 . . . . . . 7 ((𝐴𝑉𝐵𝑊𝑥𝐵) → (𝐴 × {𝑥}) ≈ 𝐴)
43ensymd 8349 . . . . . 6 ((𝐴𝑉𝐵𝑊𝑥𝐵) → 𝐴 ≈ (𝐴 × {𝑥}))
5 xpexg 7284 . . . . . . . 8 ((𝐴𝑉𝐵𝑊) → (𝐴 × 𝐵) ∈ V)
653adant3 1112 . . . . . . 7 ((𝐴𝑉𝐵𝑊𝑥𝐵) → (𝐴 × 𝐵) ∈ V)
7 simp3 1118 . . . . . . . . 9 ((𝐴𝑉𝐵𝑊𝑥𝐵) → 𝑥𝐵)
87snssd 4610 . . . . . . . 8 ((𝐴𝑉𝐵𝑊𝑥𝐵) → {𝑥} ⊆ 𝐵)
9 xpss2 5420 . . . . . . . 8 ({𝑥} ⊆ 𝐵 → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵))
108, 9syl 17 . . . . . . 7 ((𝐴𝑉𝐵𝑊𝑥𝐵) → (𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵))
11 ssdomg 8344 . . . . . . 7 ((𝐴 × 𝐵) ∈ V → ((𝐴 × {𝑥}) ⊆ (𝐴 × 𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)))
126, 10, 11sylc 65 . . . . . 6 ((𝐴𝑉𝐵𝑊𝑥𝐵) → (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵))
13 endomtr 8356 . . . . . 6 ((𝐴 ≈ (𝐴 × {𝑥}) ∧ (𝐴 × {𝑥}) ≼ (𝐴 × 𝐵)) → 𝐴 ≼ (𝐴 × 𝐵))
144, 12, 13syl2anc 576 . . . . 5 ((𝐴𝑉𝐵𝑊𝑥𝐵) → 𝐴 ≼ (𝐴 × 𝐵))
15143expia 1101 . . . 4 ((𝐴𝑉𝐵𝑊) → (𝑥𝐵𝐴 ≼ (𝐴 × 𝐵)))
1615exlimdv 1892 . . 3 ((𝐴𝑉𝐵𝑊) → (∃𝑥 𝑥𝐵𝐴 ≼ (𝐴 × 𝐵)))
171, 16syl5bi 234 . 2 ((𝐴𝑉𝐵𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 × 𝐵)))
18173impia 1097 1 ((𝐴𝑉𝐵𝑊𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 387  w3a 1068  wex 1742  wcel 2048  wne 2961  Vcvv 3409  wss 3825  c0 4173  {csn 4435   class class class wbr 4923   × cxp 5398  cen 8295  cdom 8296
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ne 2962  df-ral 3087  df-rex 3088  df-rab 3091  df-v 3411  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-nul 4174  df-if 4345  df-pw 4418  df-sn 4436  df-pr 4438  df-op 4442  df-uni 4707  df-int 4744  df-br 4924  df-opab 4986  df-mpt 5003  df-id 5305  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-rn 5411  df-res 5412  df-ima 5413  df-fun 6184  df-fn 6185  df-f 6186  df-f1 6187  df-fo 6188  df-f1o 6189  df-er 8081  df-en 8299  df-dom 8300
This theorem is referenced by:  mapdom2  8476  xpfir  8527  infxpabs  9424
  Copyright terms: Public domain W3C validator