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

Theorem sucxpdom 8730
Description: Cartesian product dominates successor for set with cardinality greater than 1. Proposition 10.38 of [TakeutiZaring] p. 93 (but generalized to arbitrary sets, not just ordinals). (Contributed by NM, 3-Sep-2004.) (Proof shortened by Mario Carneiro, 27-Apr-2015.)
Assertion
Ref Expression
sucxpdom (1o𝐴 → suc 𝐴 ≼ (𝐴 × 𝐴))

Proof of Theorem sucxpdom
StepHypRef Expression
1 df-suc 6200 . 2 suc 𝐴 = (𝐴 ∪ {𝐴})
2 relsdom 8519 . . . . . . . . 9 Rel ≺
32brrelex2i 5612 . . . . . . . 8 (1o𝐴𝐴 ∈ V)
4 1on 8112 . . . . . . . 8 1o ∈ On
5 xpsneng 8605 . . . . . . . 8 ((𝐴 ∈ V ∧ 1o ∈ On) → (𝐴 × {1o}) ≈ 𝐴)
63, 4, 5sylancl 588 . . . . . . 7 (1o𝐴 → (𝐴 × {1o}) ≈ 𝐴)
76ensymd 8563 . . . . . 6 (1o𝐴𝐴 ≈ (𝐴 × {1o}))
8 endom 8539 . . . . . 6 (𝐴 ≈ (𝐴 × {1o}) → 𝐴 ≼ (𝐴 × {1o}))
97, 8syl 17 . . . . 5 (1o𝐴𝐴 ≼ (𝐴 × {1o}))
10 ensn1g 8577 . . . . . . . . 9 (𝐴 ∈ V → {𝐴} ≈ 1o)
113, 10syl 17 . . . . . . . 8 (1o𝐴 → {𝐴} ≈ 1o)
12 ensdomtr 8656 . . . . . . . 8 (({𝐴} ≈ 1o ∧ 1o𝐴) → {𝐴} ≺ 𝐴)
1311, 12mpancom 686 . . . . . . 7 (1o𝐴 → {𝐴} ≺ 𝐴)
14 0ex 5214 . . . . . . . . 9 ∅ ∈ V
15 xpsneng 8605 . . . . . . . . 9 ((𝐴 ∈ V ∧ ∅ ∈ V) → (𝐴 × {∅}) ≈ 𝐴)
163, 14, 15sylancl 588 . . . . . . . 8 (1o𝐴 → (𝐴 × {∅}) ≈ 𝐴)
1716ensymd 8563 . . . . . . 7 (1o𝐴𝐴 ≈ (𝐴 × {∅}))
18 sdomentr 8654 . . . . . . 7 (({𝐴} ≺ 𝐴𝐴 ≈ (𝐴 × {∅})) → {𝐴} ≺ (𝐴 × {∅}))
1913, 17, 18syl2anc 586 . . . . . 6 (1o𝐴 → {𝐴} ≺ (𝐴 × {∅}))
20 sdomdom 8540 . . . . . 6 ({𝐴} ≺ (𝐴 × {∅}) → {𝐴} ≼ (𝐴 × {∅}))
2119, 20syl 17 . . . . 5 (1o𝐴 → {𝐴} ≼ (𝐴 × {∅}))
22 1n0 8122 . . . . . 6 1o ≠ ∅
23 xpsndisj 6023 . . . . . 6 (1o ≠ ∅ → ((𝐴 × {1o}) ∩ (𝐴 × {∅})) = ∅)
2422, 23mp1i 13 . . . . 5 (1o𝐴 → ((𝐴 × {1o}) ∩ (𝐴 × {∅})) = ∅)
25 undom 8608 . . . . 5 (((𝐴 ≼ (𝐴 × {1o}) ∧ {𝐴} ≼ (𝐴 × {∅})) ∧ ((𝐴 × {1o}) ∩ (𝐴 × {∅})) = ∅) → (𝐴 ∪ {𝐴}) ≼ ((𝐴 × {1o}) ∪ (𝐴 × {∅})))
269, 21, 24, 25syl21anc 835 . . . 4 (1o𝐴 → (𝐴 ∪ {𝐴}) ≼ ((𝐴 × {1o}) ∪ (𝐴 × {∅})))
27 sdomentr 8654 . . . . . 6 ((1o𝐴𝐴 ≈ (𝐴 × {1o})) → 1o ≺ (𝐴 × {1o}))
287, 27mpdan 685 . . . . 5 (1o𝐴 → 1o ≺ (𝐴 × {1o}))
29 sdomentr 8654 . . . . . 6 ((1o𝐴𝐴 ≈ (𝐴 × {∅})) → 1o ≺ (𝐴 × {∅}))
3017, 29mpdan 685 . . . . 5 (1o𝐴 → 1o ≺ (𝐴 × {∅}))
31 unxpdom 8728 . . . . 5 ((1o ≺ (𝐴 × {1o}) ∧ 1o ≺ (𝐴 × {∅})) → ((𝐴 × {1o}) ∪ (𝐴 × {∅})) ≼ ((𝐴 × {1o}) × (𝐴 × {∅})))
3228, 30, 31syl2anc 586 . . . 4 (1o𝐴 → ((𝐴 × {1o}) ∪ (𝐴 × {∅})) ≼ ((𝐴 × {1o}) × (𝐴 × {∅})))
33 domtr 8565 . . . 4 (((𝐴 ∪ {𝐴}) ≼ ((𝐴 × {1o}) ∪ (𝐴 × {∅})) ∧ ((𝐴 × {1o}) ∪ (𝐴 × {∅})) ≼ ((𝐴 × {1o}) × (𝐴 × {∅}))) → (𝐴 ∪ {𝐴}) ≼ ((𝐴 × {1o}) × (𝐴 × {∅})))
3426, 32, 33syl2anc 586 . . 3 (1o𝐴 → (𝐴 ∪ {𝐴}) ≼ ((𝐴 × {1o}) × (𝐴 × {∅})))
35 xpen 8683 . . . 4 (((𝐴 × {1o}) ≈ 𝐴 ∧ (𝐴 × {∅}) ≈ 𝐴) → ((𝐴 × {1o}) × (𝐴 × {∅})) ≈ (𝐴 × 𝐴))
366, 16, 35syl2anc 586 . . 3 (1o𝐴 → ((𝐴 × {1o}) × (𝐴 × {∅})) ≈ (𝐴 × 𝐴))
37 domentr 8571 . . 3 (((𝐴 ∪ {𝐴}) ≼ ((𝐴 × {1o}) × (𝐴 × {∅})) ∧ ((𝐴 × {1o}) × (𝐴 × {∅})) ≈ (𝐴 × 𝐴)) → (𝐴 ∪ {𝐴}) ≼ (𝐴 × 𝐴))
3834, 36, 37syl2anc 586 . 2 (1o𝐴 → (𝐴 ∪ {𝐴}) ≼ (𝐴 × 𝐴))
391, 38eqbrtrid 5104 1 (1o𝐴 → suc 𝐴 ≼ (𝐴 × 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1536  wcel 2113  wne 3019  Vcvv 3497  cun 3937  cin 3938  c0 4294  {csn 4570   class class class wbr 5069   × cxp 5556  Oncon0 6194  suc csuc 6196  1oc1o 8098  cen 8509  cdom 8510  csdm 8511
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-3or 1084  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-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  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-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-om 7584  df-1st 7692  df-2nd 7693  df-1o 8105  df-2o 8106  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator