Theorem ordtypelem9 9540

Description: Lemma for ordtype 9546. Either the function OrdIso is an isomorphism onto all of 𝐴, or OrdIso is not a set, which by oif 9544 implies that either ran 𝑂 ⊆ 𝐴 is a proper class or dom 𝑂 = On. (Contributed by Mario Carneiro, 25-Jun-2015.) (Revised by AV, 28-Jul-2024.)

Hypotheses

Ref	Expression
ordtypelem.1	⊢ 𝐹 = recs(𝐺)
ordtypelem.2	⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
ordtypelem.3	⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
ordtypelem.5	⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}
ordtypelem.6	⊢ 𝑂 = OrdIso(𝑅, 𝐴)
ordtypelem.7	⊢ (𝜑 → 𝑅 We 𝐴)
ordtypelem.8	⊢ (𝜑 → 𝑅 Se 𝐴)
ordtypelem9.1	⊢ (𝜑 → 𝑂 ∈ 𝑉)

Assertion

Ref	Expression
ordtypelem9	⊢ (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴))

Distinct variable groups:   𝑣,𝑢,𝐶   ℎ,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧,𝑅   𝐴,ℎ,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧   𝑡,𝑂,𝑢,𝑣,𝑥   𝜑,𝑡,𝑥   ℎ,𝐹,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧

Allowed substitution hints:   𝜑(𝑧,𝑤,𝑣,𝑢,ℎ,𝑗)   𝐶(𝑥,𝑧,𝑤,𝑡,ℎ,𝑗)   𝑇(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,ℎ,𝑗)   𝐺(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,ℎ,𝑗)   𝑂(𝑧,𝑤,ℎ,𝑗)   𝑉(𝑥,𝑧,𝑤,𝑣,𝑢,𝑡,ℎ,𝑗)

Proof of Theorem ordtypelem9

Dummy variables 𝑎 𝑏 𝑐 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordtypelem.1	. . 3 ⊢ 𝐹 = recs(𝐺)
2		ordtypelem.2	. . 3 ⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
3		ordtypelem.3	. . 3 ⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
4		ordtypelem.5	. . 3 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}
5		ordtypelem.6	. . 3 ⊢ 𝑂 = OrdIso(𝑅, 𝐴)
6		ordtypelem.7	. . 3 ⊢ (𝜑 → 𝑅 We 𝐴)
7		ordtypelem.8	. . 3 ⊢ (𝜑 → 𝑅 Se 𝐴)
8	1, 2, 3, 4, 5, 6, 7	ordtypelem8 9539	. 2 ⊢ (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂))
9	1, 2, 3, 4, 5, 6, 7	ordtypelem4 9535	. . . . 5 ⊢ (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
10	9	frnd 6714	. . . 4 ⊢ (𝜑 → ran 𝑂 ⊆ 𝐴)
11	1, 2, 3, 4, 5, 6, 7	ordtypelem2 9533	. . . . . . . . . . 11 ⊢ (𝜑 → Ord 𝑇)
12		ordirr 6370	. . . . . . . . . . 11 ⊢ (Ord 𝑇 → ¬ 𝑇 ∈ 𝑇)
13	11, 12	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑇 ∈ 𝑇)
14	1	tfr1a 8408	. . . . . . . . . . . . . 14 ⊢ (Fun 𝐹 ∧ Lim dom 𝐹)
15	14	simpri 485	. . . . . . . . . . . . 13 ⊢ Lim dom 𝐹
16		limord 6413	. . . . . . . . . . . . 13 ⊢ (Lim dom 𝐹 → Ord dom 𝐹)
17	15, 16	ax-mp 5	. . . . . . . . . . . 12 ⊢ Ord dom 𝐹
18	1, 2, 3, 4, 5, 6, 7	ordtypelem1 9532	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇))
19		ordtypelem9.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑂 ∈ 𝑉)
20	19	elexd 3483	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑂 ∈ V)
21	18, 20	eqeltrrd 2835	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹 ↾ 𝑇) ∈ V)
22	1	tfr2b 8410	. . . . . . . . . . . . . 14 ⊢ (Ord 𝑇 → (𝑇 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑇) ∈ V))
23	11, 22	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑇 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑇) ∈ V))
24	21, 23	mpbird 257	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 ∈ dom 𝐹)
25		ordelon 6376	. . . . . . . . . . . 12 ⊢ ((Ord dom 𝐹 ∧ 𝑇 ∈ dom 𝐹) → 𝑇 ∈ On)
26	17, 24, 25	sylancr 587	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑇 ∈ On)
27		imaeq2 6043	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝑇 → (𝐹 “ 𝑎) = (𝐹 “ 𝑇))
28	27	raleqdv 3305	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑇 → (∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
29	28	rexbidv 3164	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑇 → (∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
30		breq1 5122	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 𝑐 → (𝑧𝑅𝑡 ↔ 𝑐𝑅𝑡))
31	30	cbvralvw 3220	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑡)
32		breq2 5123	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑡 = 𝑏 → (𝑐𝑅𝑡 ↔ 𝑐𝑅𝑏))
33	32	ralbidv 3163	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑡 = 𝑏 → (∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏))
34	31, 33	bitrid 283	. . . . . . . . . . . . . . . . 17 ⊢ (𝑡 = 𝑏 → (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏))
35	34	cbvrexvw 3221	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏)
36		imaeq2 6043	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑎 → (𝐹 “ 𝑥) = (𝐹 “ 𝑎))
37	36	raleqdv 3305	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑎 → (∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
38	37	rexbidv 3164	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑎 → (∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
39	35, 38	bitrid 283	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑎 → (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
40	39	cbvrabv 3426	. . . . . . . . . . . . . 14 ⊢ {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} = {𝑎 ∈ On ∣ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏}
41	4, 40	eqtri 2758	. . . . . . . . . . . . 13 ⊢ 𝑇 = {𝑎 ∈ On ∣ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏}
42	29, 41	elrab2 3674	. . . . . . . . . . . 12 ⊢ (𝑇 ∈ 𝑇 ↔ (𝑇 ∈ On ∧ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
43	42	baib 535	. . . . . . . . . . 11 ⊢ (𝑇 ∈ On → (𝑇 ∈ 𝑇 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
44	26, 43	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑇 ∈ 𝑇 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
45	13, 44	mtbid 324	. . . . . . . . 9 ⊢ (𝜑 → ¬ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
46		ralnex 3062	. . . . . . . . 9 ⊢ (∀𝑏 ∈ 𝐴 ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏 ↔ ¬ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
47	45, 46	sylibr 234	. . . . . . . 8 ⊢ (𝜑 → ∀𝑏 ∈ 𝐴 ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
48	47	r19.21bi 3234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
49	18	rneqd 5918	. . . . . . . . . . 11 ⊢ (𝜑 → ran 𝑂 = ran (𝐹 ↾ 𝑇))
50		df-ima 5667	. . . . . . . . . . 11 ⊢ (𝐹 “ 𝑇) = ran (𝐹 ↾ 𝑇)
51	49, 50	eqtr4di 2788	. . . . . . . . . 10 ⊢ (𝜑 → ran 𝑂 = (𝐹 “ 𝑇))
52	51	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → ran 𝑂 = (𝐹 “ 𝑇))
53	52	raleqdv 3305	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
54	9	ffund 6710	. . . . . . . . . . 11 ⊢ (𝜑 → Fun 𝑂)
55	54	funfnd 6567	. . . . . . . . . 10 ⊢ (𝜑 → 𝑂 Fn dom 𝑂)
56	55	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑂 Fn dom 𝑂)
57		breq1 5122	. . . . . . . . . 10 ⊢ (𝑐 = (𝑂‘𝑚) → (𝑐𝑅𝑏 ↔ (𝑂‘𝑚)𝑅𝑏))
58	57	ralrn 7078	. . . . . . . . 9 ⊢ (𝑂 Fn dom 𝑂 → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
59	56, 58	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
60	53, 59	bitr3d 281	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
61	48, 60	mtbid 324	. . . . . 6 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
62		rexnal 3089	. . . . . 6 ⊢ (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 ↔ ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
63	61, 62	sylibr 234	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → ∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏)
64	1, 2, 3, 4, 5, 6, 7	ordtypelem7 9538	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → ((𝑂‘𝑚)𝑅𝑏 ∨ 𝑏 ∈ ran 𝑂))
65	64	ord 864	. . . . . 6 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → (¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
66	65	rexlimdva 3141	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
67	63, 66	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ ran 𝑂)
68	10, 67	eqelssd 3980	. . 3 ⊢ (𝜑 → ran 𝑂 = 𝐴)
69		isoeq5 7314	. . 3 ⊢ (ran 𝑂 = 𝐴 → (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) ↔ 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴)))
70	68, 69	syl 17	. 2 ⊢ (𝜑 → (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) ↔ 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴)))
71	8, 70	mpbid 232	1 ⊢ (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3051  ∃wrex 3060  {crab 3415  Vcvv 3459   ∩ cin 3925   class class class wbr 5119   ↦ cmpt 5201   E cep 5552   Se wse 5604   We wwe 5605  dom cdm 5654  ran crn 5655   ↾ cres 5656   “ cima 5657  Ord word 6351  Oncon0 6352  Lim wlim 6353  Fun wfun 6525   Fn wfn 6526  ‘cfv 6531   Isom wiso 6532  ℩crio 7361  recscrecs 8384  OrdIsocoi 9523

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 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402  ax-un 7729

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-oi 9524

This theorem is referenced by:  ordtypelem10  9541  ordtype2  9548