Theorem ordtypelem6 8311

Description: Lemma for ordtype 8320. (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 792	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑁 ∈ 𝑀)
2		ssrab2 3650	. . . . . . . 8 ⊢ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣} ⊆ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}
3		simpr 476	. . . . . . . . . 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 8309	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
12		fdm 5964	. . . . . . . . . . . 12 ⊢ (𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴 → dom 𝑂 = (𝑇 ∩ dom 𝐹))
13	11, 12	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝑂 = (𝑇 ∩ dom 𝐹))
14	13	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → dom 𝑂 = (𝑇 ∩ dom 𝐹))
15	3, 14	eleqtrd 2690	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ (𝑇 ∩ dom 𝐹))
16	4, 5, 6, 7, 8, 9, 10	ordtypelem3 8308	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
17	15, 16	syldan 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
18	2, 17	sseldi 3566	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤})
19		breq2 4587	. . . . . . . . . 10 ⊢ (𝑤 = (𝐹‘𝑀) → (𝑗𝑅𝑤 ↔ 𝑗𝑅(𝐹‘𝑀)))
20	19	ralbidv 2969	. . . . . . . . 9 ⊢ (𝑤 = (𝐹‘𝑀) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤 ↔ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀)))
21	20	elrab 3331	. . . . . . . 8 ⊢ ((𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ↔ ((𝐹‘𝑀) ∈ 𝐴 ∧ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀)))
22	21	simprbi 479	. . . . . . 7 ⊢ ((𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} → ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀))
23	18, 22	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀))
24	4	tfr1a 7377	. . . . . . . . 9 ⊢ (Fun 𝐹 ∧ Lim dom 𝐹)
25	24	simpli 473	. . . . . . . 8 ⊢ Fun 𝐹
26		funfn 5833	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
27	25, 26	mpbi 219	. . . . . . 7 ⊢ 𝐹 Fn dom 𝐹
28	24	simpri 477	. . . . . . . . 9 ⊢ Lim dom 𝐹
29		limord 5701	. . . . . . . . 9 ⊢ (Lim dom 𝐹 → Ord dom 𝐹)
30	28, 29	ax-mp 5	. . . . . . . 8 ⊢ Ord dom 𝐹
31		inss2 3796	. . . . . . . . . 10 ⊢ (𝑇 ∩ dom 𝐹) ⊆ dom 𝐹
32	13, 31	syl6eqss 3618	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑂 ⊆ dom 𝐹)
33	32	sselda 3568	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ dom 𝐹)
34		ordelss 5656	. . . . . . . 8 ⊢ ((Ord dom 𝐹 ∧ 𝑀 ∈ dom 𝐹) → 𝑀 ⊆ dom 𝐹)
35	30, 33, 34	sylancr 694	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ⊆ dom 𝐹)
36		breq1 4586	. . . . . . . 8 ⊢ (𝑗 = (𝐹‘𝑎) → (𝑗𝑅(𝐹‘𝑀) ↔ (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
37	36	ralima 6402	. . . . . . 7 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑀 ⊆ dom 𝐹) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀) ↔ ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
38	27, 35, 37	sylancr 694	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀) ↔ ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
39	23, 38	mpbid 221	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀))
40	39	adantrr 749	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀))
41		fveq2 6103	. . . . . 6 ⊢ (𝑎 = 𝑁 → (𝐹‘𝑎) = (𝐹‘𝑁))
42	41	breq1d 4593	. . . . 5 ⊢ (𝑎 = 𝑁 → ((𝐹‘𝑎)𝑅(𝐹‘𝑀) ↔ (𝐹‘𝑁)𝑅(𝐹‘𝑀)))
43	42	rspcv 3278	. . . 4 ⊢ (𝑁 ∈ 𝑀 → (∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀) → (𝐹‘𝑁)𝑅(𝐹‘𝑀)))
44	1, 40, 43	sylc 63	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝐹‘𝑁)𝑅(𝐹‘𝑀))
45	4, 5, 6, 7, 8, 9, 10	ordtypelem1 8306	. . . . . 6 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇))
46	45	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑂 = (𝐹 ↾ 𝑇))
47	46	fveq1d 6105	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁) = ((𝐹 ↾ 𝑇)‘𝑁))
48	4, 5, 6, 7, 8, 9, 10	ordtypelem2 8307	. . . . . . . 8 ⊢ (𝜑 → Ord 𝑇)
49	48	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → Ord 𝑇)
50		inss1 3795	. . . . . . . . . 10 ⊢ (𝑇 ∩ dom 𝐹) ⊆ 𝑇
51	13, 50	syl6eqss 3618	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑂 ⊆ 𝑇)
52	51	sselda 3568	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ 𝑇)
53	52	adantrr 749	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑀 ∈ 𝑇)
54		ordelss 5656	. . . . . . 7 ⊢ ((Ord 𝑇 ∧ 𝑀 ∈ 𝑇) → 𝑀 ⊆ 𝑇)
55	49, 53, 54	syl2anc 691	. . . . . 6 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑀 ⊆ 𝑇)
56	55, 1	sseldd 3569	. . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑁 ∈ 𝑇)
57		fvres 6117	. . . . 5 ⊢ (𝑁 ∈ 𝑇 → ((𝐹 ↾ 𝑇)‘𝑁) = (𝐹‘𝑁))
58	56, 57	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ((𝐹 ↾ 𝑇)‘𝑁) = (𝐹‘𝑁))
59	47, 58	eqtrd 2644	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁) = (𝐹‘𝑁))
60	46	fveq1d 6105	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑀) = ((𝐹 ↾ 𝑇)‘𝑀))
61		fvres 6117	. . . . 5 ⊢ (𝑀 ∈ 𝑇 → ((𝐹 ↾ 𝑇)‘𝑀) = (𝐹‘𝑀))
62	53, 61	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ((𝐹 ↾ 𝑇)‘𝑀) = (𝐹‘𝑀))
63	60, 62	eqtrd 2644	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑀) = (𝐹‘𝑀))
64	44, 59, 63	3brtr4d 4615	. 2 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁)𝑅(𝑂‘𝑀))
65	64	expr 641	1 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝑁 ∈ 𝑀 → (𝑂‘𝑁)𝑅(𝑂‘𝑀)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  {crab 2900  Vcvv 3173   ∩ cin 3539   ⊆ wss 3540   class class class wbr 4583   ↦ cmpt 4643   Se wse 4995   We wwe 4996  dom cdm 5038  ran crn 5039   ↾ cres 5040   “ cima 5041  Ord word 5639  Oncon0 5640  Lim wlim 5641  Fun wfun 5798   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804  ℩crio 6510  recscrecs 7354  OrdIsocoi 8297

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-wrecs 7294  df-recs 7355  df-oi 8298

This theorem is referenced by:  ordtypelem8  8313