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

Theorem ranksnb 7586
Description: The rank of a singleton. Theorem 15.17(v) of [Monk1] p. 112. (Contributed by Mario Carneiro, 10-Jun-2013.)
Assertion
Ref Expression
ranksnb  |-  ( A  e.  U. ( R1
" On )  -> 
( rank `  { A } )  =  suc  ( rank `  A )
)

Proof of Theorem ranksnb
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 5605 . . . . . 6  |-  ( y  =  A  ->  ( rank `  y )  =  ( rank `  A
) )
21eleq1d 2424 . . . . 5  |-  ( y  =  A  ->  (
( rank `  y )  e.  x  <->  ( rank `  A
)  e.  x ) )
32ralsng 3748 . . . 4  |-  ( A  e.  U. ( R1
" On )  -> 
( A. y  e. 
{ A }  ( rank `  y )  e.  x  <->  ( rank `  A
)  e.  x ) )
43rabbidv 2856 . . 3  |-  ( A  e.  U. ( R1
" On )  ->  { x  e.  On  |  A. y  e.  { A }  ( rank `  y )  e.  x }  =  { x  e.  On  |  ( rank `  A )  e.  x } )
54inteqd 3946 . 2  |-  ( A  e.  U. ( R1
" On )  ->  |^| { x  e.  On  |  A. y  e.  { A }  ( rank `  y )  e.  x }  =  |^| { x  e.  On  |  ( rank `  A )  e.  x } )
6 snwf 7568 . . 3  |-  ( A  e.  U. ( R1
" On )  ->  { A }  e.  U. ( R1 " On ) )
7 rankval3b 7585 . . 3  |-  ( { A }  e.  U. ( R1 " On )  ->  ( rank `  { A } )  =  |^| { x  e.  On  |  A. y  e.  { A }  ( rank `  y
)  e.  x }
)
86, 7syl 15 . 2  |-  ( A  e.  U. ( R1
" On )  -> 
( rank `  { A } )  =  |^| { x  e.  On  |  A. y  e.  { A }  ( rank `  y
)  e.  x }
)
9 rankon 7554 . . 3  |-  ( rank `  A )  e.  On
10 onsucmin 4691 . . 3  |-  ( (
rank `  A )  e.  On  ->  suc  ( rank `  A )  =  |^| { x  e.  On  | 
( rank `  A )  e.  x } )
119, 10mp1i 11 . 2  |-  ( A  e.  U. ( R1
" On )  ->  suc  ( rank `  A
)  =  |^| { x  e.  On  |  ( rank `  A )  e.  x } )
125, 8, 113eqtr4d 2400 1  |-  ( A  e.  U. ( R1
" On )  -> 
( rank `  { A } )  =  suc  ( rank `  A )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1642    e. wcel 1710   A.wral 2619   {crab 2623   {csn 3716   U.cuni 3906   |^|cint 3941   Oncon0 4471   suc csuc 4473   "cima 4771   ` cfv 5334   R1cr1 7521   rankcrnk 7522
This theorem is referenced by:  rankprb  7610  ranksn  7613  rankcf  8486  rankaltopb  25072
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-sep 4220  ax-nul 4228  ax-pow 4267  ax-pr 4293  ax-un 4591
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-ral 2624  df-rex 2625  df-reu 2626  df-rab 2628  df-v 2866  df-sbc 3068  df-csb 3158  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-pss 3244  df-nul 3532  df-if 3642  df-pw 3703  df-sn 3722  df-pr 3723  df-tp 3724  df-op 3725  df-uni 3907  df-int 3942  df-iun 3986  df-br 4103  df-opab 4157  df-mpt 4158  df-tr 4193  df-eprel 4384  df-id 4388  df-po 4393  df-so 4394  df-fr 4431  df-we 4433  df-ord 4474  df-on 4475  df-lim 4476  df-suc 4477  df-om 4736  df-xp 4774  df-rel 4775  df-cnv 4776  df-co 4777  df-dm 4778  df-rn 4779  df-res 4780  df-ima 4781  df-iota 5298  df-fun 5336  df-fn 5337  df-f 5338  df-f1 5339  df-fo 5340  df-f1o 5341  df-fv 5342  df-recs 6472  df-rdg 6507  df-r1 7523  df-rank 7524
  Copyright terms: Public domain W3C validator