Theorem rankf 9720

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 9691	. . . 4 ⊢ rank = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
2	1	funmpt2 6541	. . 3 ⊢ Fun rank
3		mptv 5206	. . . . . 6 ⊢ (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}) = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
4	1, 3	eqtri 2760	. . . . 5 ⊢ rank = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
5	4	dmeqi 5863	. . . 4 ⊢ dom rank = dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
6		dmopab 5874	. . . . 5 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
7		eqabcb 2877	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On) ↔ ∀𝑥(∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On)))
8		rankwflemb 9719	. . . . . . 7 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
9		intexrab 5296	. . . . . . 7 ⊢ (∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦) ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
10		isset 3456	. . . . . . 7 ⊢ (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V ↔ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
11	8, 9, 10	3bitrri 298	. . . . . 6 ⊢ (∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On))
12	7, 11	mpgbir 1801	. . . . 5 ⊢ {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
13	6, 12	eqtri 2760	. . . 4 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
14	5, 13	eqtri 2760	. . 3 ⊢ dom rank = ∪ (𝑅1 “ On)
15		df-fn 6505	. . 3 ⊢ (rank Fn ∪ (𝑅1 “ On) ↔ (Fun rank ∧ dom rank = ∪ (𝑅1 “ On)))
16	2, 14, 15	mpbir2an 712	. 2 ⊢ rank Fn ∪ (𝑅1 “ On)
17		rabn0 4343	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
18	8, 17	bitr4i 278	. . . 4 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅)
19		intex 5293	. . . . . 6 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
20		vex 3446	. . . . . . 7 ⊢ 𝑥 ∈ V
21	1	fvmpt2 6963	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V) → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
22	20, 21	mpan 691	. . . . . 6 ⊢ (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
23	19, 22	sylbi 217	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
24		ssrab2 4034	. . . . . 6 ⊢ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On
25		oninton 7752	. . . . . 6 ⊢ (({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On ∧ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅) → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
26	24, 25	mpan 691	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
27	23, 26	eqeltrd 2837	. . . 4 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) ∈ On)
28	18, 27	sylbi 217	. . 3 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) ∈ On)
29	28	rgen 3054	. 2 ⊢ ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On
30		ffnfv 7075	. 2 ⊢ (rank:∪ (𝑅1 “ On)⟶On ↔ (rank Fn ∪ (𝑅1 “ On) ∧ ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On))
31	16, 29, 30	mpbir2an 712	1 ⊢ rank:∪ (𝑅1 “ On)⟶On

Syntax hints:   ↔ wb 206   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401  Vcvv 3442   ⊆ wss 3903  ∅c0 4287  ∪ cuni 4865  ∩ cint 4904  {copab 5162   ↦ cmpt 5181  dom cdm 5634   “ cima 5637  Oncon0 6327  suc csuc 6329  Fun wfun 6496   Fn wfn 6497  ⟶wf 6498  ‘cfv 6502  𝑅₁cr1 9688  rankcrnk 9689

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-om 7821  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-r1 9690  df-rank 9691

This theorem is referenced by:  rankon  9721  rankvaln  9725  tcrank  9810  hsmexlem4  10353  hsmexlem5  10354  grur1  10745  regsfromunir1  36698  aomclem4  43443  rankrelp  45345