Theorem rankf 9718

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 9689	. . . 4 ⊢ rank = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
2	1	funmpt2 6537	. . 3 ⊢ Fun rank
3		mptv 5191	. . . . . 6 ⊢ (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}) = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
4	1, 3	eqtri 2759	. . . . 5 ⊢ rank = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
5	4	dmeqi 5859	. . . 4 ⊢ dom rank = dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
6		dmopab 5870	. . . . 5 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
7		eqabcb 2876	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On) ↔ ∀𝑥(∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On)))
8		rankwflemb 9717	. . . . . . 7 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
9		intexrab 5288	. . . . . . 7 ⊢ (∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦) ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
10		isset 3443	. . . . . . 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 2759	. . . 4 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On)
14	5, 13	eqtri 2759	. . 3 ⊢ dom rank = ∪ (𝑅1 “ On)
15		df-fn 6501	. . 3 ⊢ (rank Fn ∪ (𝑅1 “ On) ↔ (Fun rank ∧ dom rank = ∪ (𝑅1 “ On)))
16	2, 14, 15	mpbir2an 712	. 2 ⊢ rank Fn ∪ (𝑅1 “ On)
17		rabn0 4329	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
18	8, 17	bitr4i 278	. . . 4 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅)
19		intex 5285	. . . . . 6 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
20		vex 3433	. . . . . . 7 ⊢ 𝑥 ∈ V
21	1	fvmpt2 6959	. . . . . . 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 4020	. . . . . 6 ⊢ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On
25		oninton 7749	. . . . . 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 2836	. . . 4 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) ∈ On)
28	18, 27	sylbi 217	. . 3 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) ∈ On)
29	28	rgen 3053	. 2 ⊢ ∀𝑥 ∈ ∪ (𝑅1 “ On)(rank‘𝑥) ∈ On
30		ffnfv 7071	. 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 2714   ≠ wne 2932  ∀wral 3051  ∃wrex 3061  {crab 3389  Vcvv 3429   ⊆ wss 3889  ∅c0 4273  ∪ cuni 4850  ∩ cint 4889  {copab 5147   ↦ cmpt 5166  dom cdm 5631   “ cima 5634  Oncon0 6323  suc csuc 6325  Fun wfun 6492   Fn wfn 6493  ⟶wf 6494  ‘cfv 6498  𝑅₁cr1 9686  rankcrnk 9687

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 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-r1 9688  df-rank 9689

This theorem is referenced by:  rankon  9719  rankvaln  9723  tcrank  9808  hsmexlem4  10351  hsmexlem5  10352  grur1  10743  regsfromunir1  36722  aomclem4  43485  rankrelp  45387