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

Theorem rankf 9826
Description: The domain and codomain of the rank function. (Contributed by Mario Carneiro, 28-May-2013.) (Revised by Mario Carneiro, 12-Sep-2013.)
Assertion
Ref Expression
rankf rank:∪ (𝑅1 “ On)⟶On

Proof of Theorem rankf
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-rank 9793 . . . 4 rank = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
21funmpt2 6596 . . 3 Fun rank
3 mptv 5214 . . . . . 6 (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}) = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
41, 3eqtri 2786 . . . . 5 rank = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
54dmeqi 5892 . . . 4 dom rank = dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
6 dmopab 5903 . . . . 5 dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
7 eqabcb 2904 . . . . . 6 ({𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On) ↔ ∀𝑥(∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On)))
8 rankwflemb 9824 . . . . . . 7 (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
9 intexrab 5312 . . . . . . 7 (∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦) ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
10 isset 3468 . . . . . . 7 (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V ↔ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
118, 9, 103bitrri 301 . . . . . 6 (∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On))
127, 11mpgbir 1832 . . . . 5 {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
136, 12eqtri 2786 . . . 4 dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
145, 13eqtri 2786 . . 3 dom rank = ∪ (𝑅1 “ On)
15 df-fn 6558 . . 3 (rank Fn ∪ (𝑅1 “ On) ↔ (Fun rank ∧ dom rank = ∪ (𝑅1 “ On)))
162, 14, 15mpbir2an 724 . 2 rank Fn ∪ (𝑅1 “ On)
17 rabn0 4342 . . . . 5 ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
188, 17bitr4i 281 . . . 4 (𝑥 ∈ ∪ (𝑅1 “ On) ↔ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅)
19 intex 5309 . . . . . 6 ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
20 vex 3458 . . . . . . 7 𝑥 ∈ V
211fvmpt2 7025 . . . . . . 7 ((𝑥 ∈ V ∧ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V) → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
2220, 21mpan 703 . . . . . 6 (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
2319, 22sylbi 220 . . . . 5 ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
24 ssrab2 4008 . . . . . 6 {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On
25 oninton 7830 . . . . . 6 (({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On ∧ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅) → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
2624, 25mpan 703 . . . . 5 ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
2723, 26eqeltrd 2864 . . . 4 ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) ∈ On)
2818, 27sylbi 220 . . 3 (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) ∈ On)
2928rgen 3082 . 2 ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On
30 ffnfv 7140 . 2 (rank:∪ (𝑅1 “ On)⟶On ↔ (rank Fn ∪ (𝑅1 “ On) ∧ ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On))
3116, 29, 30mpbir2an 724 1 rank:∪ (𝑅1 “ On)⟶On
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ∪ cuni 4870  ∩ cint 4910  {copab 5170   ↦ cmpt 5189  dom cdm 5655   “ cima 5658  Oncon0 6377  suc csuc 6379  Fun wfun 6549   Fn wfn 6550  ⟶wf 6551  ‘cfv 6555  𝑅1cr1 9790  rankcrnk 9791
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-r1 9792  df-rank 9793
This theorem is used by:  rankon  9827  rankvaln  9831  tcrank  9925  hsmexlem4  10531  hsmexlem5  10532  grur1  10929  rankfo  35816  regsfromunir1  37505  aomclem4  44250  rankrelp  46143
  Copyright terms: Public domain W3C validator