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

Theorem rankidb 9770
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 9763 . . 3 (𝐴 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
2 nfcv 2924 . . . . . 6 𝑥𝑅1
3 nfrab1 3435 . . . . . . . 8 𝑥{𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}
43nfint 4921 . . . . . . 7 𝑥 {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}
54nfsuc 6435 . . . . . 6 𝑥 suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}
62, 5nffv 6891 . . . . 5 𝑥(𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
76nfel2 2942 . . . 4 𝑥 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
8 suceq 6429 . . . . . 6 (𝑥 = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc 𝑥 = suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
98fveq2d 6885 . . . . 5 (𝑥 = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝑅1‘suc 𝑥) = (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
109eleq2d 2848 . . . 4 (𝑥 = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})))
117, 10onminsb 7791 . . 3 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
121, 11sylbi 220 . 2 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
13 rankvalb 9767 . . . 4 (𝐴 (𝑅1 “ On) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
14 suceq 6429 . . . 4 ((rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → suc (rank‘𝐴) = suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
1513, 14syl 18 . . 3 (𝐴 (𝑅1 “ On) → suc (rank‘𝐴) = suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
1615fveq2d 6885 . 2 (𝐴 (𝑅1 “ On) → (𝑅1‘suc (rank‘𝐴)) = (𝑅1‘suc {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)}))
1712, 16eleqtrrd 2865 1 (𝐴 (𝑅1 “ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1569  wcel 2142  wrex 3088  {crab 3415   cuni 4871   cint 4911  cima 5663  Oncon0 6360  suc csuc 6362  cfv 6536  𝑅1cr1 9732  rankcrnk 9733
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-om 7861  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-r1 9734  df-rank 9735
This theorem is used by:  rankdmr1  9771  rankr1ag  9772  sswf  9778  uniwf  9789  rankonidlem  9798  rankid  9803  dfac12lem2  10135  rankval4b  35502  r1filimi  35506  aomclem4  43812
  Copyright terms: Public domain W3C validator