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

Theorem harwdom 8051
Description: The Hartogs function is weakly dominated by  ~P ( X  X.  X ). This follows from a more precise analysis of the bound used in hartogs 8005 to prove that  (har `  X ) is a set. (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
harwdom  |-  ( X  e.  V  ->  (har `  X )  ~<_*  ~P ( X  X.  X ) )

Proof of Theorem harwdom
Dummy variables  y 
r  f  s  t  w  x  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2422 . . . . . 6  |-  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  =  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }
2 eqid 2422 . . . . . 6  |-  { <. s ,  t >.  |  E. w  e.  y  E. z  e.  y  (
( s  =  ( f `  w )  /\  t  =  ( f `  z ) )  /\  w  _E  z ) }  =  { <. s ,  t
>.  |  E. w  e.  y  E. z  e.  y  ( (
s  =  ( f `
 w )  /\  t  =  ( f `  z ) )  /\  w  _E  z ) }
31, 2hartogslem1 8003 . . . . 5  |-  ( dom 
{ <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  C_  ~P ( X  X.  X )  /\  Fun  { <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  /\  ( X  e.  V  ->  ran  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  =  { x  e.  On  |  x  ~<_  X } ) )
43simp2i 1015 . . . 4  |-  Fun  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }
53simp1i 1014 . . . . 5  |-  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  C_  ~P ( X  X.  X )
6 sqxpexg 6547 . . . . . 6  |-  ( X  e.  V  ->  ( X  X.  X )  e. 
_V )
7 pwexg 4544 . . . . . 6  |-  ( ( X  X.  X )  e.  _V  ->  ~P ( X  X.  X
)  e.  _V )
86, 7syl 17 . . . . 5  |-  ( X  e.  V  ->  ~P ( X  X.  X
)  e.  _V )
9 ssexg 4506 . . . . 5  |-  ( ( dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  C_  ~P ( X  X.  X )  /\  ~P ( X  X.  X
)  e.  _V )  ->  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  e.  _V )
105, 8, 9sylancr 667 . . . 4  |-  ( X  e.  V  ->  dom  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  e.  _V )
11 funex 6085 . . . 4  |-  ( ( Fun  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  /\  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  e.  _V )  ->  { <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  e.  _V )
124, 10, 11sylancr 667 . . 3  |-  ( X  e.  V  ->  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  e.  _V )
13 funfn 5566 . . . . . 6  |-  ( Fun 
{ <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  <->  { <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  Fn  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } )
144, 13mpbi 211 . . . . 5  |-  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  Fn  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }
1514a1i 11 . . . 4  |-  ( X  e.  V  ->  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  Fn  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } )
163simp3i 1016 . . . . 5  |-  ( X  e.  V  ->  ran  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  =  { x  e.  On  |  x  ~<_  X } )
17 harval 8023 . . . . 5  |-  ( X  e.  V  ->  (har `  X )  =  {
x  e.  On  |  x  ~<_  X } )
1816, 17eqtr4d 2459 . . . 4  |-  ( X  e.  V  ->  ran  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  =  (har `  X ) )
19 df-fo 5543 . . . 4  |-  ( {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } : dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } -onto-> (har `  X )  <->  ( { <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  Fn  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  /\  ran  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  =  (har `  X ) ) )
2015, 18, 19sylanbrc 668 . . 3  |-  ( X  e.  V  ->  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) } : dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } -onto-> (har `  X )
)
21 fowdom 8032 . . 3  |-  ( ( { <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  e.  _V  /\  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } : dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) } -onto-> (har `  X )
)  ->  (har `  X
)  ~<_*  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) } )
2212, 20, 21syl2anc 665 . 2  |-  ( X  e.  V  ->  (har `  X )  ~<_*  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) } )
23 ssdomg 7562 . . . 4  |-  ( ~P ( X  X.  X
)  e.  _V  ->  ( dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r )  C_  r  /\  r  C_  ( dom  r  X.  dom  r
) )  /\  (
r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r  \  _I  ) ,  dom  r ) ) }  C_  ~P ( X  X.  X )  ->  dom  { <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  ~<_  ~P ( X  X.  X ) ) )
248, 5, 23mpisyl 21 . . 3  |-  ( X  e.  V  ->  dom  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  ~<_  ~P ( X  X.  X ) )
25 domwdom 8035 . . 3  |-  ( dom 
{ <. r ,  y
>.  |  ( (
( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  ~<_  ~P ( X  X.  X )  ->  dom  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  ~<_*  ~P ( X  X.  X ) )
2624, 25syl 17 . 2  |-  ( X  e.  V  ->  dom  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  ~<_*  ~P ( X  X.  X ) )
27 wdomtr 8036 . 2  |-  ( ( (har `  X )  ~<_*  dom  {
<. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  /\  dom  { <. r ,  y >.  |  ( ( ( dom  r  C_  X  /\  (  _I  |`  dom  r
)  C_  r  /\  r  C_  ( dom  r  X.  dom  r ) )  /\  ( r  \  _I  )  We  dom  r )  /\  y  =  dom OrdIso ( ( r 
\  _I  ) ,  dom  r ) ) }  ~<_*  ~P ( X  X.  X ) )  -> 
(har `  X )  ~<_*  ~P ( X  X.  X
) )
2822, 26, 27syl2anc 665 1  |-  ( X  e.  V  ->  (har `  X )  ~<_*  ~P ( X  X.  X ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 370    /\ w3a 982    = wceq 1437    e. wcel 1872   E.wrex 2709   {crab 2712   _Vcvv 3016    \ cdif 3369    C_ wss 3372   ~Pcpw 3917   class class class wbr 4359   {copab 4417    _E cep 4698    _I cid 4699    We wwe 4747    X. cxp 4787   dom cdm 4789   ran crn 4790    |` cres 4791   Oncon0 5378   Fun wfun 5531    Fn wfn 5532   -onto->wfo 5535   ` cfv 5537    ~<_ cdom 7515  OrdIsocoi 7970  harchar 8017    ~<_* cwdom 8018
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-8 1874  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2058  ax-ext 2402  ax-rep 4472  ax-sep 4482  ax-nul 4491  ax-pow 4538  ax-pr 4596  ax-un 6534
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2274  df-mo 2275  df-clab 2409  df-cleq 2415  df-clel 2418  df-nfc 2552  df-ne 2595  df-ral 2713  df-rex 2714  df-reu 2715  df-rmo 2716  df-rab 2717  df-v 3018  df-sbc 3236  df-csb 3332  df-dif 3375  df-un 3377  df-in 3379  df-ss 3386  df-pss 3388  df-nul 3698  df-if 3848  df-pw 3919  df-sn 3935  df-pr 3937  df-tp 3939  df-op 3941  df-uni 4156  df-iun 4237  df-br 4360  df-opab 4419  df-mpt 4420  df-tr 4455  df-eprel 4700  df-id 4704  df-po 4710  df-so 4711  df-fr 4748  df-se 4749  df-we 4750  df-xp 4795  df-rel 4796  df-cnv 4797  df-co 4798  df-dm 4799  df-rn 4800  df-res 4801  df-ima 4802  df-pred 5335  df-ord 5381  df-on 5382  df-lim 5383  df-suc 5384  df-iota 5501  df-fun 5539  df-fn 5540  df-f 5541  df-f1 5542  df-fo 5543  df-f1o 5544  df-fv 5545  df-isom 5546  df-riota 6204  df-wrecs 6976  df-recs 7038  df-er 7311  df-en 7518  df-dom 7519  df-sdom 7520  df-oi 7971  df-har 8019  df-wdom 8020
This theorem is referenced by:  gchhar  9048
  Copyright terms: Public domain W3C validator