MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infunabs Unicode version

Theorem infunabs 7833
Description: An infinite set is equinumerous to its union with a smaller one. (Contributed by NM, 28-Sep-2004.) (Revised by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
infunabs  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  u.  B )  ~~  A )

Proof of Theorem infunabs
StepHypRef Expression
1 simp1 955 . . . 4  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  A  e.  dom  card )
2 reldom 6869 . . . . . 6  |-  Rel  ~<_
32brrelexi 4729 . . . . 5  |-  ( B  ~<_  A  ->  B  e.  _V )
433ad2ant3 978 . . . 4  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  B  e.  _V )
5 uncdadom 7797 . . . 4  |-  ( ( A  e.  dom  card  /\  B  e.  _V )  ->  ( A  u.  B
)  ~<_  ( A  +c  B ) )
61, 4, 5syl2anc 642 . . 3  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  u.  B )  ~<_  ( A  +c  B
) )
7 infcdaabs 7832 . . 3  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  +c  B )  ~~  A )
8 domentr 6920 . . 3  |-  ( ( ( A  u.  B
)  ~<_  ( A  +c  B )  /\  ( A  +c  B )  ~~  A )  ->  ( A  u.  B )  ~<_  A )
96, 7, 8syl2anc 642 . 2  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  u.  B )  ~<_  A )
10 unexg 4521 . . . 4  |-  ( ( A  e.  dom  card  /\  B  e.  _V )  ->  ( A  u.  B
)  e.  _V )
111, 4, 10syl2anc 642 . . 3  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  u.  B )  e.  _V )
12 ssun1 3338 . . 3  |-  A  C_  ( A  u.  B
)
13 ssdomg 6907 . . 3  |-  ( ( A  u.  B )  e.  _V  ->  ( A  C_  ( A  u.  B )  ->  A  ~<_  ( A  u.  B
) ) )
1411, 12, 13ee10 1366 . 2  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  A  ~<_  ( A  u.  B
) )
15 sbth 6981 . 2  |-  ( ( ( A  u.  B
)  ~<_  A  /\  A  ~<_  ( A  u.  B
) )  ->  ( A  u.  B )  ~~  A )
169, 14, 15syl2anc 642 1  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  u.  B )  ~~  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 934    e. wcel 1684   _Vcvv 2788    u. cun 3150    C_ wss 3152   class class class wbr 4023   omcom 4656   dom cdm 4689  (class class class)co 5858    ~~ cen 6860    ~<_ cdom 6861   cardccrd 7568    +c ccda 7793
This theorem is referenced by:  infunsdom1  7839  infxp  7841
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-inf2 7342
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-int 3863  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-se 4353  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-isom 5264  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-riota 6304  df-recs 6388  df-rdg 6423  df-1o 6479  df-2o 6480  df-oadd 6483  df-er 6660  df-en 6864  df-dom 6865  df-sdom 6866  df-fin 6867  df-oi 7225  df-card 7572  df-cda 7794
  Copyright terms: Public domain W3C validator