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

Theorem rankidb 9814
Description: Identity law for the rank function. (Contributed by NM, 3-Oct-2003.) (Revised by Mario Carneiro, 22-Mar-2013.)
Assertion
Ref Expression
rankidb (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))

Proof of Theorem rankidb
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 rankwflemb 9807 . . 3 (𝐴 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
2 nfcv 2898 . . . . . 6 𝑥𝑅1
3 nfrab1 3436 . . . . . . . 8 𝑥{𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}
43nfint 4932 . . . . . . 7 𝑥 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}
54nfsuc 6426 . . . . . 6 𝑥 suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}
62, 5nffv 6886 . . . . 5 𝑥(𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
76nfel2 2917 . . . 4 𝑥 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
8 suceq 6419 . . . . . 6 (𝑥 = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc 𝑥 = suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
98fveq2d 6880 . . . . 5 (𝑥 = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝑅1‘suc 𝑥) = (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
109eleq2d 2820 . . . 4 (𝑥 = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})))
117, 10onminsb 7788 . . 3 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
121, 11sylbi 217 . 2 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
13 rankvalb 9811 . . . 4 (𝐴 (𝑅1 “ On) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
14 suceq 6419 . . . 4 ((rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc (rank‘𝐴) = suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
1513, 14syl 17 . . 3 (𝐴 (𝑅1 “ On) → suc (rank‘𝐴) = suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
1615fveq2d 6880 . 2 (𝐴 (𝑅1 “ On) → (𝑅1‘suc (rank‘𝐴)) = (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
1712, 16eleqtrrd 2837 1 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2108  wrex 3060  {crab 3415   cuni 4883   cint 4922  cima 5657  Oncon0 6352  suc csuc 6354  cfv 6531  𝑅1cr1 9776  rankcrnk 9777
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 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-om 7862  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-r1 9778  df-rank 9779
This theorem is referenced by:  rankdmr1  9815  rankr1ag  9816  sswf  9822  uniwf  9833  rankonidlem  9842  rankid  9847  dfac12lem2  10159  aomclem4  43081
  Copyright terms: Public domain W3C validator