Theorem oicl 8839

Description: The order type of the well-order 𝑅 on 𝐴 is an ordinal. (Contributed by Mario Carneiro, 23-May-2015.) (Revised by Mario Carneiro, 25-Jun-2015.)

Hypothesis

Ref	Expression
oicl.1	⊢ 𝐹 = OrdIso(𝑅, 𝐴)

Assertion

Ref	Expression
oicl	⊢ Ord dom 𝐹

Proof of Theorem oicl

Dummy variables 𝑢 𝑡 𝑣 𝑥 ℎ 𝑗 𝑤 𝑧 𝑓 𝑖 𝑟 𝑠 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2795	. . . . 5 ⊢ recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) = recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
2		eqid 2795	. . . . 5 ⊢ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
3		eqid 2795	. . . . 5 ⊢ (ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) = (ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
4	1, 2, 3	ordtypecbv 8827	. . . 4 ⊢ recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = recs((ℎ ∈ V ↦ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
5		eqid 2795	. . . 4 ⊢ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡}
6		oicl.1	. . . 4 ⊢ 𝐹 = OrdIso(𝑅, 𝐴)
7		simpl 483	. . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 We 𝐴)
8		simpr 485	. . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴)
9	4, 2, 3, 5, 6, 7, 8	ordtypelem5 8832	. . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (Ord dom 𝐹 ∧ 𝐹:dom 𝐹⟶𝐴))
10	9	simpld 495	. 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → Ord dom 𝐹)
11		ord0 6118	. . 3 ⊢ Ord ∅
12	6	oi0 8838	. . . . . 6 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 = ∅)
13	12	dmeqd 5660	. . . . 5 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → dom 𝐹 = dom ∅)
14		dm0 5676	. . . . 5 ⊢ dom ∅ = ∅
15	13, 14	syl6eq 2847	. . . 4 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → dom 𝐹 = ∅)
16		ordeq 6073	. . . 4 ⊢ (dom 𝐹 = ∅ → (Ord dom 𝐹 ↔ Ord ∅))
17	15, 16	syl 17	. . 3 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (Ord dom 𝐹 ↔ Ord ∅))
18	11, 17	mpbiri 259	. 2 ⊢ (¬ (𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → Ord dom 𝐹)
19	10, 18	pm2.61i 183	1 ⊢ Ord dom 𝐹

Syntax hints:  ¬ wn 3   ↔ wb 207   ∧ wa 396   = wceq 1522  ∀wral 3105  ∃wrex 3106  {crab 3109  Vcvv 3437  ∅c0 4211   class class class wbr 4962   ↦ cmpt 5041   Se wse 5400   We wwe 5401  dom cdm 5443  ran crn 5444   “ cima 5446  Ord word 6065  Oncon0 6066  ⟶wf 6221  ℩crio 6976  recscrecs 7859  OrdIsocoi 8819

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221  ax-un 7319

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rmo 3113  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-pss 3876  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-tp 4477  df-op 4479  df-uni 4746  df-iun 4827  df-br 4963  df-opab 5025  df-mpt 5042  df-tr 5064  df-id 5348  df-eprel 5353  df-po 5362  df-so 5363  df-fr 5402  df-se 5403  df-we 5404  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-pred 6023  df-ord 6069  df-on 6070  df-lim 6071  df-suc 6072  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-riota 6977  df-wrecs 7798  df-recs 7860  df-oi 8820

This theorem is referenced by:  oion  8846  oieu  8849  oismo  8850  oiid  8851  wofib  8855  cantnflt  8981  cantnfp1lem3  8989  cantnflem1b  8995  cantnflem1  8998  wemapwe  9006  cnfcomlem  9008  cnfcom  9009  cnfcom2lem  9010  infxpenlem  9285  hsmexlem1  9694  fpwwe2lem8  9905  fpwwe2lem9  9906  fpwwe2lem10  9907