Theorem rankf 9834

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.

Step	Hyp	Ref	Expression
1		df-rank 9805	. . . 4 ⊢ rank = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
2	1	funmpt2 6605	. . 3 ⊢ Fun rank
3		mptv 5258	. . . . . 6 ⊢ (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}) = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
4	1, 3	eqtri 2765	. . . . 5 ⊢ rank = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
5	4	dmeqi 5915	. . . 4 ⊢ dom rank = dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
6		dmopab 5926	. . . . 5 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
7		eqabcb 2883	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On) ↔ ∀𝑥(∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On)))
8		rankwflemb 9833	. . . . . . 7 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
9		intexrab 5347	. . . . . . 7 ⊢ (∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦) ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
10		isset 3494	. . . . . . 7 ⊢ (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V ↔ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
11	8, 9, 10	3bitrri 298	. . . . . 6 ⊢ (∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On))
12	7, 11	mpgbir 1799	. . . . 5 ⊢ {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
13	6, 12	eqtri 2765	. . . 4 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
14	5, 13	eqtri 2765	. . 3 ⊢ dom rank = ∪ (𝑅1 “ On)
15		df-fn 6564	. . 3 ⊢ (rank Fn ∪ (𝑅1 “ On) ↔ (Fun rank ∧ dom rank = ∪ (𝑅1 “ On)))
16	2, 14, 15	mpbir2an 711	. 2 ⊢ rank Fn ∪ (𝑅1 “ On)
17		rabn0 4389	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
18	8, 17	bitr4i 278	. . . 4 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅)
19		intex 5344	. . . . . 6 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
20		vex 3484	. . . . . . 7 ⊢ 𝑥 ∈ V
21	1	fvmpt2 7027	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V) → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
22	20, 21	mpan 690	. . . . . 6 ⊢ (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
23	19, 22	sylbi 217	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
24		ssrab2 4080	. . . . . 6 ⊢ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On
25		oninton 7815	. . . . . 6 ⊢ (({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On ∧ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅) → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
26	24, 25	mpan 690	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
27	23, 26	eqeltrd 2841	. . . 4 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) ∈ On)
28	18, 27	sylbi 217	. . 3 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) ∈ On)
29	28	rgen 3063	. 2 ⊢ ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On
30		ffnfv 7139	. 2 ⊢ (rank:∪ (𝑅1 “ On)⟶On ↔ (rank Fn ∪ (𝑅1 “ On) ∧ ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On))
31	16, 29, 30	mpbir2an 711	1 ⊢ rank:∪ (𝑅1 “ On)⟶On

Syntax hints:   ↔ wb 206   = wceq 1540  ∃wex 1779   ∈ wcel 2108  {cab 2714   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  {crab 3436  Vcvv 3480   ⊆ wss 3951  ∅c0 4333  ∪ cuni 4907  ∩ cint 4946  {copab 5205   ↦ cmpt 5225  dom cdm 5685   “ cima 5688  Oncon0 6384  suc csuc 6386  Fun wfun 6555   Fn wfn 6556  ⟶wf 6557  ‘cfv 6561  𝑅₁cr1 9802  rankcrnk 9803

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 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-r1 9804  df-rank 9805

This theorem is referenced by:  rankon  9835  rankvaln  9839  tcrank  9924  hsmexlem4  10469  hsmexlem5  10470  grur1  10860  aomclem4  43069  rankrelp  44977