Theorem ordtypelem10 8702

Description: Lemma for ordtype 8707. Using ax-rep 4995, exclude the possibility that 𝑂 is a proper class and does not enumerate all of 𝐴. (Contributed by Mario Carneiro, 25-Jun-2015.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem ordtypelem10

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 8700	. 2 ⊢ (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂))
9	1, 2, 3, 4, 5, 6, 7	ordtypelem4 8696	. . . . 5 ⊢ (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
10	9	frnd 6286	. . . 4 ⊢ (𝜑 → ran 𝑂 ⊆ 𝐴)
11		simprl 789	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑏 ∈ 𝐴)
12	6	adantr 474	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑅 We 𝐴)
13	7	adantr 474	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑅 Se 𝐴)
14	1, 2, 3, 4, 5, 12, 13	ordtypelem8 8700	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂))
15		isof1o 6829	. . . . . . . . . . 11 ⊢ (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) → 𝑂:dom 𝑂–1-1-onto→ran 𝑂)
16		f1of 6379	. . . . . . . . . . 11 ⊢ (𝑂:dom 𝑂–1-1-onto→ran 𝑂 → 𝑂:dom 𝑂⟶ran 𝑂)
17	14, 15, 16	3syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑂:dom 𝑂⟶ran 𝑂)
18		f1of1 6378	. . . . . . . . . . . 12 ⊢ (𝑂:dom 𝑂–1-1-onto→ran 𝑂 → 𝑂:dom 𝑂–1-1→ran 𝑂)
19	14, 15, 18	3syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑂:dom 𝑂–1-1→ran 𝑂)
20		simpl 476	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂) → 𝑏 ∈ 𝐴)
21		seex 5306	. . . . . . . . . . . . 13 ⊢ ((𝑅 Se 𝐴 ∧ 𝑏 ∈ 𝐴) → {𝑐 ∈ 𝐴 ∣ 𝑐𝑅𝑏} ∈ V)
22	7, 20, 21	syl2an 591	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → {𝑐 ∈ 𝐴 ∣ 𝑐𝑅𝑏} ∈ V)
23	10	adantr 474	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → ran 𝑂 ⊆ 𝐴)
24		rexnal 3204	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 ↔ ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
25	1, 2, 3, 4, 5, 6, 7	ordtypelem7 8699	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → ((𝑂‘𝑚)𝑅𝑏 ∨ 𝑏 ∈ ran 𝑂))
26	25	ord 897	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → (¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
27	26	rexlimdva 3241	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
28	24, 27	syl5bir 235	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
29	28	con1d 142	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (¬ 𝑏 ∈ ran 𝑂 → ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
30	29	impr 448	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
31	9	ffund 6283	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → Fun 𝑂)
32		funfn 6154	. . . . . . . . . . . . . . . . 17 ⊢ (Fun 𝑂 ↔ 𝑂 Fn dom 𝑂)
33	31, 32	sylib 210	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑂 Fn dom 𝑂)
34	33	adantr 474	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑂 Fn dom 𝑂)
35		breq1 4877	. . . . . . . . . . . . . . . 16 ⊢ (𝑐 = (𝑂‘𝑚) → (𝑐𝑅𝑏 ↔ (𝑂‘𝑚)𝑅𝑏))
36	35	ralrn 6612	. . . . . . . . . . . . . . 15 ⊢ (𝑂 Fn dom 𝑂 → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
37	34, 36	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
38	30, 37	mpbird 249	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → ∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏)
39		ssrab 3906	. . . . . . . . . . . . 13 ⊢ (ran 𝑂 ⊆ {𝑐 ∈ 𝐴 ∣ 𝑐𝑅𝑏} ↔ (ran 𝑂 ⊆ 𝐴 ∧ ∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏))
40	23, 38, 39	sylanbrc 580	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → ran 𝑂 ⊆ {𝑐 ∈ 𝐴 ∣ 𝑐𝑅𝑏})
41	22, 40	ssexd 5031	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → ran 𝑂 ∈ V)
42		f1dmex 7399	. . . . . . . . . . 11 ⊢ ((𝑂:dom 𝑂–1-1→ran 𝑂 ∧ ran 𝑂 ∈ V) → dom 𝑂 ∈ V)
43	19, 41, 42	syl2anc 581	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → dom 𝑂 ∈ V)
44		fex 6746	. . . . . . . . . 10 ⊢ ((𝑂:dom 𝑂⟶ran 𝑂 ∧ dom 𝑂 ∈ V) → 𝑂 ∈ V)
45	17, 43, 44	syl2anc 581	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑂 ∈ V)
46	1, 2, 3, 4, 5, 12, 13, 45	ordtypelem9 8701	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴))
47		isof1o 6829	. . . . . . . 8 ⊢ (𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴) → 𝑂:dom 𝑂–1-1-onto→𝐴)
48		f1ofo 6386	. . . . . . . 8 ⊢ (𝑂:dom 𝑂–1-1-onto→𝐴 → 𝑂:dom 𝑂–onto→𝐴)
49		forn 6357	. . . . . . . 8 ⊢ (𝑂:dom 𝑂–onto→𝐴 → ran 𝑂 = 𝐴)
50	46, 47, 48, 49	4syl 19	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → ran 𝑂 = 𝐴)
51	11, 50	eleqtrrd 2910	. . . . . 6 ⊢ ((𝜑 ∧ (𝑏 ∈ 𝐴 ∧ ¬ 𝑏 ∈ ran 𝑂)) → 𝑏 ∈ ran 𝑂)
52	51	expr 450	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → (¬ 𝑏 ∈ ran 𝑂 → 𝑏 ∈ ran 𝑂))
53	52	pm2.18d 127	. . . 4 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ ran 𝑂)
54	10, 53	eqelssd 3848	. . 3 ⊢ (𝜑 → ran 𝑂 = 𝐴)
55		isoeq5 6827	. . 3 ⊢ (ran 𝑂 = 𝐴 → (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) ↔ 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴)))
56	54, 55	syl 17	. 2 ⊢ (𝜑 → (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) ↔ 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴)))
57	8, 56	mpbid 224	1 ⊢ (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 198   ∧ wa 386   = wceq 1658   ∈ wcel 2166  ∀wral 3118  ∃wrex 3119  {crab 3122  Vcvv 3415   ∩ cin 3798   ⊆ wss 3799   class class class wbr 4874   ↦ cmpt 4953   E cep 5255   Se wse 5300   We wwe 5301  dom cdm 5343  ran crn 5344   “ cima 5346  Oncon0 5964  Fun wfun 6118   Fn wfn 6119  ⟶wf 6120  –1-1→wf1 6121  –onto→wfo 6122  –1-1-onto→wf1o 6123  ‘cfv 6124   Isom wiso 6125  ℩crio 6866  recscrecs 7734  OrdIsocoi 8684

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2804  ax-rep 4995  ax-sep 5006  ax-nul 5014  ax-pow 5066  ax-pr 5128  ax-un 7210

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3or 1114  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2606  df-eu 2641  df-clab 2813  df-cleq 2819  df-clel 2822  df-nfc 2959  df-ne 3001  df-ral 3123  df-rex 3124  df-reu 3125  df-rmo 3126  df-rab 3127  df-v 3417  df-sbc 3664  df-csb 3759  df-dif 3802  df-un 3804  df-in 3806  df-ss 3813  df-pss 3815  df-nul 4146  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-tp 4403  df-op 4405  df-uni 4660  df-iun 4743  df-br 4875  df-opab 4937  df-mpt 4954  df-tr 4977  df-id 5251  df-eprel 5256  df-po 5264  df-so 5265  df-fr 5302  df-se 5303  df-we 5304  df-xp 5349  df-rel 5350  df-cnv 5351  df-co 5352  df-dm 5353  df-rn 5354  df-res 5355  df-ima 5356  df-pred 5921  df-ord 5967  df-on 5968  df-lim 5969  df-suc 5970  df-iota 6087  df-fun 6126  df-fn 6127  df-f 6128  df-f1 6129  df-fo 6130  df-f1o 6131  df-fv 6132  df-isom 6133  df-riota 6867  df-wrecs 7673  df-recs 7735  df-oi 8685

This theorem is referenced by:  ordtype  8707