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

Theorem ranksnb 9258
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 (𝐴 (𝑅1 “ On) → (rank‘{𝐴}) = suc (rank‘𝐴))

Proof of Theorem ranksnb
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6672 . . . . . 6 (𝑦 = 𝐴 → (rank‘𝑦) = (rank‘𝐴))
21eleq1d 2899 . . . . 5 (𝑦 = 𝐴 → ((rank‘𝑦) ∈ 𝑥 ↔ (rank‘𝐴) ∈ 𝑥))
32ralsng 4615 . . . 4 (𝐴 (𝑅1 “ On) → (∀𝑦 ∈ {𝐴} (rank‘𝑦) ∈ 𝑥 ↔ (rank‘𝐴) ∈ 𝑥))
43rabbidv 3482 . . 3 (𝐴 (𝑅1 “ On) → {𝑥 ∈ On ∣ ∀𝑦 ∈ {𝐴} (rank‘𝑦) ∈ 𝑥} = {𝑥 ∈ On ∣ (rank‘𝐴) ∈ 𝑥})
54inteqd 4883 . 2 (𝐴 (𝑅1 “ On) → {𝑥 ∈ On ∣ ∀𝑦 ∈ {𝐴} (rank‘𝑦) ∈ 𝑥} = {𝑥 ∈ On ∣ (rank‘𝐴) ∈ 𝑥})
6 snwf 9240 . . 3 (𝐴 (𝑅1 “ On) → {𝐴} ∈ (𝑅1 “ On))
7 rankval3b 9257 . . 3 ({𝐴} ∈ (𝑅1 “ On) → (rank‘{𝐴}) = {𝑥 ∈ On ∣ ∀𝑦 ∈ {𝐴} (rank‘𝑦) ∈ 𝑥})
86, 7syl 17 . 2 (𝐴 (𝑅1 “ On) → (rank‘{𝐴}) = {𝑥 ∈ On ∣ ∀𝑦 ∈ {𝐴} (rank‘𝑦) ∈ 𝑥})
9 rankon 9226 . . 3 (rank‘𝐴) ∈ On
10 onsucmin 7538 . . 3 ((rank‘𝐴) ∈ On → suc (rank‘𝐴) = {𝑥 ∈ On ∣ (rank‘𝐴) ∈ 𝑥})
119, 10mp1i 13 . 2 (𝐴 (𝑅1 “ On) → suc (rank‘𝐴) = {𝑥 ∈ On ∣ (rank‘𝐴) ∈ 𝑥})
125, 8, 113eqtr4d 2868 1 (𝐴 (𝑅1 “ On) → (rank‘{𝐴}) = suc (rank‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  wral 3140  {crab 3144  {csn 4569   cuni 4840   cint 4878  cima 5560  Oncon0 6193  suc csuc 6195  cfv 6357  𝑅1cr1 9193  rankcrnk 9194
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-r1 9195  df-rank 9196
This theorem is referenced by:  rankprb  9282  ranksn  9285  rankcf  10201  rankaltopb  33442
  Copyright terms: Public domain W3C validator