Theorem rankf 9739

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 9710	. . . 4 ⊢ rank = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
2	1	funmpt2 6545	. . 3 ⊢ Fun rank
3		mptv 5226	. . . . . 6 ⊢ (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}) = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
4	1, 3	eqtri 2759	. . . . 5 ⊢ rank = {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
5	4	dmeqi 5865	. . . 4 ⊢ dom rank = dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
6		dmopab 5876	. . . . 5 ⊢ dom {⟨𝑥, 𝑧⟩ ∣ 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = {𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}}
7		eqabcb 2874	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)}} = ∪ (𝑅1 “ On) ↔ ∀𝑥(∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ↔ 𝑥 ∈ ∪ (𝑅1 “ On)))
8		rankwflemb 9738	. . . . . . 7 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
9		intexrab 5302	. . . . . . 7 ⊢ (∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦) ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
10		isset 3459	. . . . . . 7 ⊢ (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V ↔ ∃𝑧 𝑧 = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
11	8, 9, 10	3bitrri 297	. . . . . 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 6504	. . 3 ⊢ (rank Fn ∪ (𝑅1 “ On) ↔ (Fun rank ∧ dom rank = ∪ (𝑅1 “ On)))
16	2, 14, 15	mpbir2an 709	. 2 ⊢ rank Fn ∪ (𝑅1 “ On)
17		rabn0 4350	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∃𝑦 ∈ On 𝑥 ∈ (𝑅1‘suc 𝑦))
18	8, 17	bitr4i 277	. . . 4 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) ↔ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅)
19		intex 5299	. . . . . 6 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ ↔ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V)
20		vex 3450	. . . . . . 7 ⊢ 𝑥 ∈ V
21	1	fvmpt2 6964	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V) → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
22	20, 21	mpan 688	. . . . . 6 ⊢ (∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ V → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
23	19, 22	sylbi 216	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) = ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)})
24		ssrab2 4042	. . . . . 6 ⊢ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On
25		oninton 7735	. . . . . 6 ⊢ (({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ⊆ On ∧ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅) → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
26	24, 25	mpan 688	. . . . 5 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → ∩ {𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ∈ On)
27	23, 26	eqeltrd 2832	. . . 4 ⊢ ({𝑦 ∈ On ∣ 𝑥 ∈ (𝑅1‘suc 𝑦)} ≠ ∅ → (rank‘𝑥) ∈ On)
28	18, 27	sylbi 216	. . 3 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) ∈ On)
29	28	rgen 3062	. 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 709	1 ⊢ rank:∪ (𝑅1 “ On)⟶On

Syntax hints:   ↔ wb 205   = wceq 1541  ∃wex 1781   ∈ wcel 2106  {cab 2708   ≠ wne 2939  ∀wral 3060  ∃wrex 3069  {crab 3405  Vcvv 3446   ⊆ wss 3913  ∅c0 4287  ∪ cuni 4870  ∩ cint 4912  {copab 5172   ↦ cmpt 5193  dom cdm 5638   “ cima 5641  Oncon0 6322  suc csuc 6324  Fun wfun 6495   Fn wfn 6496  ⟶wf 6497  ‘cfv 6501  𝑅₁cr1 9707  rankcrnk 9708

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-int 4913  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6258  df-ord 6325  df-on 6326  df-lim 6327  df-suc 6328  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-ov 7365  df-om 7808  df-2nd 7927  df-frecs 8217  df-wrecs 8248  df-recs 8322  df-rdg 8361  df-r1 9709  df-rank 9710

This theorem is referenced by:  rankon  9740  rankvaln  9744  tcrank  9829  hsmexlem4  10374  hsmexlem5  10375  grur1  10765  aomclem4  41442