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

Theorem rankvalb 8607
 Description: Value of the rank function. Definition 9.14 of [TakeutiZaring] p. 79 (proved as a theorem from our definition). This variant of rankval 8626 does not use Regularity, and so requires the assumption that 𝐴 is in the range of 𝑅1. (Contributed by NM, 11-Oct-2003.) (Revised by Mario Carneiro, 10-Sep-2013.)
Assertion
Ref Expression
rankvalb (𝐴 (𝑅1 “ On) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
Distinct variable group:   𝑥,𝐴

Proof of Theorem rankvalb
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elex 3198 . 2 (𝐴 (𝑅1 “ On) → 𝐴 ∈ V)
2 rankwflemb 8603 . . 3 (𝐴 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
3 intexrab 4785 . . 3 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) ↔ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ∈ V)
42, 3sylbb 209 . 2 (𝐴 (𝑅1 “ On) → {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ∈ V)
5 eleq1 2686 . . . . 5 (𝑦 = 𝐴 → (𝑦 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ (𝑅1‘suc 𝑥)))
65rabbidv 3177 . . . 4 (𝑦 = 𝐴 → {𝑥 ∈ On ∣ 𝑦 ∈ (𝑅1‘suc 𝑥)} = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
76inteqd 4447 . . 3 (𝑦 = 𝐴 {𝑥 ∈ On ∣ 𝑦 ∈ (𝑅1‘suc 𝑥)} = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
8 df-rank 8575 . . 3 rank = (𝑦 ∈ V ↦ {𝑥 ∈ On ∣ 𝑦 ∈ (𝑅1‘suc 𝑥)})
97, 8fvmptg 6239 . 2 ((𝐴 ∈ V ∧ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ∈ V) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
101, 4, 9syl2anc 692 1 (𝐴 (𝑅1 “ On) → (rank‘𝐴) = {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1480   ∈ wcel 1987  ∃wrex 2908  {crab 2911  Vcvv 3186  ∪ cuni 4404  ∩ cint 4442   “ cima 5079  Oncon0 5684  suc csuc 5686  ‘cfv 5849  𝑅1cr1 8572  rankcrnk 8573 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4743  ax-nul 4751  ax-pow 4805  ax-pr 4869  ax-un 6905 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3419  df-csb 3516  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-pss 3572  df-nul 3894  df-if 4061  df-pw 4134  df-sn 4151  df-pr 4153  df-tp 4155  df-op 4157  df-uni 4405  df-int 4443  df-iun 4489  df-br 4616  df-opab 4676  df-mpt 4677  df-tr 4715  df-eprel 4987  df-id 4991  df-po 4997  df-so 4998  df-fr 5035  df-we 5037  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-rn 5087  df-res 5088  df-ima 5089  df-pred 5641  df-ord 5687  df-on 5688  df-lim 5689  df-suc 5690  df-iota 5812  df-fun 5851  df-fn 5852  df-f 5853  df-f1 5854  df-fo 5855  df-f1o 5856  df-fv 5857  df-om 7016  df-wrecs 7355  df-recs 7416  df-rdg 7454  df-r1 8574  df-rank 8575 This theorem is referenced by:  rankr1ai  8608  rankidb  8610  rankval  8626
 Copyright terms: Public domain W3C validator