Theorem ordtypelem6 8428

Description: Lemma for ordtype 8437. (Contributed by Mario Carneiro, 24-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
ordtypelem6	⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝑁 ∈ 𝑀 → (𝑂‘𝑁)𝑅(𝑂‘𝑀)))

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

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

Proof of Theorem ordtypelem6

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprr 796	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑁 ∈ 𝑀)
2		ssrab2 3687	. . . . . . . 8 ⊢ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣} ⊆ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}
3		simpr 477	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ dom 𝑂)
4		ordtypelem.1	. . . . . . . . . . . . 13 ⊢ 𝐹 = recs(𝐺)
5		ordtypelem.2	. . . . . . . . . . . . 13 ⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
6		ordtypelem.3	. . . . . . . . . . . . 13 ⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
7		ordtypelem.5	. . . . . . . . . . . . 13 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}
8		ordtypelem.6	. . . . . . . . . . . . 13 ⊢ 𝑂 = OrdIso(𝑅, 𝐴)
9		ordtypelem.7	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 We 𝐴)
10		ordtypelem.8	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 Se 𝐴)
11	4, 5, 6, 7, 8, 9, 10	ordtypelem4 8426	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
12		fdm 6051	. . . . . . . . . . . 12 ⊢ (𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴 → dom 𝑂 = (𝑇 ∩ dom 𝐹))
13	11, 12	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝑂 = (𝑇 ∩ dom 𝐹))
14	13	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → dom 𝑂 = (𝑇 ∩ dom 𝐹))
15	3, 14	eleqtrd 2703	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ (𝑇 ∩ dom 𝐹))
16	4, 5, 6, 7, 8, 9, 10	ordtypelem3 8425	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
17	15, 16	syldan 487	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
18	2, 17	sseldi 3601	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤})
19		breq2 4657	. . . . . . . . . 10 ⊢ (𝑤 = (𝐹‘𝑀) → (𝑗𝑅𝑤 ↔ 𝑗𝑅(𝐹‘𝑀)))
20	19	ralbidv 2986	. . . . . . . . 9 ⊢ (𝑤 = (𝐹‘𝑀) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤 ↔ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀)))
21	20	elrab 3363	. . . . . . . 8 ⊢ ((𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ↔ ((𝐹‘𝑀) ∈ 𝐴 ∧ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀)))
22	21	simprbi 480	. . . . . . 7 ⊢ ((𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} → ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀))
23	18, 22	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀))
24	4	tfr1a 7490	. . . . . . . . 9 ⊢ (Fun 𝐹 ∧ Lim dom 𝐹)
25	24	simpli 474	. . . . . . . 8 ⊢ Fun 𝐹
26		funfn 5918	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
27	25, 26	mpbi 220	. . . . . . 7 ⊢ 𝐹 Fn dom 𝐹
28	24	simpri 478	. . . . . . . . 9 ⊢ Lim dom 𝐹
29		limord 5784	. . . . . . . . 9 ⊢ (Lim dom 𝐹 → Ord dom 𝐹)
30	28, 29	ax-mp 5	. . . . . . . 8 ⊢ Ord dom 𝐹
31		inss2 3834	. . . . . . . . . 10 ⊢ (𝑇 ∩ dom 𝐹) ⊆ dom 𝐹
32	13, 31	syl6eqss 3655	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑂 ⊆ dom 𝐹)
33	32	sselda 3603	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ dom 𝐹)
34		ordelss 5739	. . . . . . . 8 ⊢ ((Ord dom 𝐹 ∧ 𝑀 ∈ dom 𝐹) → 𝑀 ⊆ dom 𝐹)
35	30, 33, 34	sylancr 695	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ⊆ dom 𝐹)
36		breq1 4656	. . . . . . . 8 ⊢ (𝑗 = (𝐹‘𝑎) → (𝑗𝑅(𝐹‘𝑀) ↔ (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
37	36	ralima 6498	. . . . . . 7 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑀 ⊆ dom 𝐹) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀) ↔ ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
38	27, 35, 37	sylancr 695	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀) ↔ ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
39	23, 38	mpbid 222	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀))
40	39	adantrr 753	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀))
41		fveq2 6191	. . . . . 6 ⊢ (𝑎 = 𝑁 → (𝐹‘𝑎) = (𝐹‘𝑁))
42	41	breq1d 4663	. . . . 5 ⊢ (𝑎 = 𝑁 → ((𝐹‘𝑎)𝑅(𝐹‘𝑀) ↔ (𝐹‘𝑁)𝑅(𝐹‘𝑀)))
43	42	rspcv 3305	. . . 4 ⊢ (𝑁 ∈ 𝑀 → (∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀) → (𝐹‘𝑁)𝑅(𝐹‘𝑀)))
44	1, 40, 43	sylc 65	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝐹‘𝑁)𝑅(𝐹‘𝑀))
45	4, 5, 6, 7, 8, 9, 10	ordtypelem1 8423	. . . . . 6 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇))
46	45	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑂 = (𝐹 ↾ 𝑇))
47	46	fveq1d 6193	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁) = ((𝐹 ↾ 𝑇)‘𝑁))
48	4, 5, 6, 7, 8, 9, 10	ordtypelem2 8424	. . . . . . . 8 ⊢ (𝜑 → Ord 𝑇)
49	48	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → Ord 𝑇)
50		inss1 3833	. . . . . . . . . 10 ⊢ (𝑇 ∩ dom 𝐹) ⊆ 𝑇
51	13, 50	syl6eqss 3655	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑂 ⊆ 𝑇)
52	51	sselda 3603	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ 𝑇)
53	52	adantrr 753	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑀 ∈ 𝑇)
54		ordelss 5739	. . . . . . 7 ⊢ ((Ord 𝑇 ∧ 𝑀 ∈ 𝑇) → 𝑀 ⊆ 𝑇)
55	49, 53, 54	syl2anc 693	. . . . . 6 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑀 ⊆ 𝑇)
56	55, 1	sseldd 3604	. . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑁 ∈ 𝑇)
57		fvres 6207	. . . . 5 ⊢ (𝑁 ∈ 𝑇 → ((𝐹 ↾ 𝑇)‘𝑁) = (𝐹‘𝑁))
58	56, 57	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ((𝐹 ↾ 𝑇)‘𝑁) = (𝐹‘𝑁))
59	47, 58	eqtrd 2656	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁) = (𝐹‘𝑁))
60	46	fveq1d 6193	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑀) = ((𝐹 ↾ 𝑇)‘𝑀))
61		fvres 6207	. . . . 5 ⊢ (𝑀 ∈ 𝑇 → ((𝐹 ↾ 𝑇)‘𝑀) = (𝐹‘𝑀))
62	53, 61	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ((𝐹 ↾ 𝑇)‘𝑀) = (𝐹‘𝑀))
63	60, 62	eqtrd 2656	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑀) = (𝐹‘𝑀))
64	44, 59, 63	3brtr4d 4685	. 2 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁)𝑅(𝑂‘𝑀))
65	64	expr 643	1 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝑁 ∈ 𝑀 → (𝑂‘𝑁)𝑅(𝑂‘𝑀)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∀wral 2912  ∃wrex 2913  {crab 2916  Vcvv 3200   ∩ cin 3573   ⊆ wss 3574   class class class wbr 4653   ↦ cmpt 4729   Se wse 5071   We wwe 5072  dom cdm 5114  ran crn 5115   ↾ cres 5116   “ cima 5117  Ord word 5722  Oncon0 5723  Lim wlim 5724  Fun wfun 5882   Fn wfn 5883  ⟶wf 5884  ‘cfv 5888  ℩crio 6610  recscrecs 7467  OrdIsocoi 8414

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-wrecs 7407  df-recs 7468  df-oi 8415

This theorem is referenced by:  ordtypelem8  8430