Theorem ordtypelem6 8704

Description: Lemma for ordtype 8713. (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		fveq2 6437	. . . . 5 ⊢ (𝑎 = 𝑁 → (𝐹‘𝑎) = (𝐹‘𝑁))
2	1	breq1d 4885	. . . 4 ⊢ (𝑎 = 𝑁 → ((𝐹‘𝑎)𝑅(𝐹‘𝑀) ↔ (𝐹‘𝑁)𝑅(𝐹‘𝑀)))
3		ssrab2 3914	. . . . . . . 8 ⊢ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣} ⊆ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}
4		simpr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ dom 𝑂)
5		ordtypelem.1	. . . . . . . . . . . . 13 ⊢ 𝐹 = recs(𝐺)
6		ordtypelem.2	. . . . . . . . . . . . 13 ⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
7		ordtypelem.3	. . . . . . . . . . . . 13 ⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
8		ordtypelem.5	. . . . . . . . . . . . 13 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}
9		ordtypelem.6	. . . . . . . . . . . . 13 ⊢ 𝑂 = OrdIso(𝑅, 𝐴)
10		ordtypelem.7	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 We 𝐴)
11		ordtypelem.8	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 Se 𝐴)
12	5, 6, 7, 8, 9, 10, 11	ordtypelem4 8702	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
13	12	fdmd 6291	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝑂 = (𝑇 ∩ dom 𝐹))
14	13	adantr 474	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → dom 𝑂 = (𝑇 ∩ dom 𝐹))
15	4, 14	eleqtrd 2908	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ (𝑇 ∩ dom 𝐹))
16	5, 6, 7, 8, 9, 10, 11	ordtypelem3 8701	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
17	15, 16	syldan 585	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
18	3, 17	sseldi 3825	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤})
19		breq2 4879	. . . . . . . . . 10 ⊢ (𝑤 = (𝐹‘𝑀) → (𝑗𝑅𝑤 ↔ 𝑗𝑅(𝐹‘𝑀)))
20	19	ralbidv 3195	. . . . . . . . 9 ⊢ (𝑤 = (𝐹‘𝑀) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤 ↔ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀)))
21	20	elrab 3585	. . . . . . . 8 ⊢ ((𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ↔ ((𝐹‘𝑀) ∈ 𝐴 ∧ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀)))
22	21	simprbi 492	. . . . . . 7 ⊢ ((𝐹‘𝑀) ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} → ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀))
23	18, 22	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀))
24	5	tfr1a 7761	. . . . . . . . 9 ⊢ (Fun 𝐹 ∧ Lim dom 𝐹)
25	24	simpli 478	. . . . . . . 8 ⊢ Fun 𝐹
26		funfn 6157	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
27	25, 26	mpbi 222	. . . . . . 7 ⊢ 𝐹 Fn dom 𝐹
28	24	simpri 481	. . . . . . . . 9 ⊢ Lim dom 𝐹
29		limord 6026	. . . . . . . . 9 ⊢ (Lim dom 𝐹 → Ord dom 𝐹)
30	28, 29	ax-mp 5	. . . . . . . 8 ⊢ Ord dom 𝐹
31		inss2 4060	. . . . . . . . . 10 ⊢ (𝑇 ∩ dom 𝐹) ⊆ dom 𝐹
32	13, 31	syl6eqss 3880	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑂 ⊆ dom 𝐹)
33	32	sselda 3827	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ dom 𝐹)
34		ordelss 5983	. . . . . . . 8 ⊢ ((Ord dom 𝐹 ∧ 𝑀 ∈ dom 𝐹) → 𝑀 ⊆ dom 𝐹)
35	30, 33, 34	sylancr 581	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ⊆ dom 𝐹)
36		breq1 4878	. . . . . . . 8 ⊢ (𝑗 = (𝐹‘𝑎) → (𝑗𝑅(𝐹‘𝑀) ↔ (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
37	36	ralima 6759	. . . . . . 7 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑀 ⊆ dom 𝐹) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀) ↔ ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
38	27, 35, 37	sylancr 581	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅(𝐹‘𝑀) ↔ ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀)))
39	23, 38	mpbid 224	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀))
40	39	adantrr 708	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ∀𝑎 ∈ 𝑀 (𝐹‘𝑎)𝑅(𝐹‘𝑀))
41		simprr 789	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑁 ∈ 𝑀)
42	2, 40, 41	rspcdva 3532	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝐹‘𝑁)𝑅(𝐹‘𝑀))
43	5, 6, 7, 8, 9, 10, 11	ordtypelem1 8699	. . . . . 6 ⊢ (𝜑 → 𝑂 = (𝐹 ↾ 𝑇))
44	43	adantr 474	. . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑂 = (𝐹 ↾ 𝑇))
45	44	fveq1d 6439	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁) = ((𝐹 ↾ 𝑇)‘𝑁))
46	5, 6, 7, 8, 9, 10, 11	ordtypelem2 8700	. . . . . . . 8 ⊢ (𝜑 → Ord 𝑇)
47	46	adantr 474	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → Ord 𝑇)
48		inss1 4059	. . . . . . . . . 10 ⊢ (𝑇 ∩ dom 𝐹) ⊆ 𝑇
49	13, 48	syl6eqss 3880	. . . . . . . . 9 ⊢ (𝜑 → dom 𝑂 ⊆ 𝑇)
50	49	sselda 3827	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → 𝑀 ∈ 𝑇)
51	50	adantrr 708	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑀 ∈ 𝑇)
52		ordelss 5983	. . . . . . 7 ⊢ ((Ord 𝑇 ∧ 𝑀 ∈ 𝑇) → 𝑀 ⊆ 𝑇)
53	47, 51, 52	syl2anc 579	. . . . . 6 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑀 ⊆ 𝑇)
54	53, 41	sseldd 3828	. . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → 𝑁 ∈ 𝑇)
55		fvres 6456	. . . . 5 ⊢ (𝑁 ∈ 𝑇 → ((𝐹 ↾ 𝑇)‘𝑁) = (𝐹‘𝑁))
56	54, 55	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ((𝐹 ↾ 𝑇)‘𝑁) = (𝐹‘𝑁))
57	45, 56	eqtrd 2861	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁) = (𝐹‘𝑁))
58	44	fveq1d 6439	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑀) = ((𝐹 ↾ 𝑇)‘𝑀))
59		fvres 6456	. . . . 5 ⊢ (𝑀 ∈ 𝑇 → ((𝐹 ↾ 𝑇)‘𝑀) = (𝐹‘𝑀))
60	51, 59	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → ((𝐹 ↾ 𝑇)‘𝑀) = (𝐹‘𝑀))
61	58, 60	eqtrd 2861	. . 3 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑀) = (𝐹‘𝑀))
62	42, 57, 61	3brtr4d 4907	. 2 ⊢ ((𝜑 ∧ (𝑀 ∈ dom 𝑂 ∧ 𝑁 ∈ 𝑀)) → (𝑂‘𝑁)𝑅(𝑂‘𝑀))
63	62	expr 450	1 ⊢ ((𝜑 ∧ 𝑀 ∈ dom 𝑂) → (𝑁 ∈ 𝑀 → (𝑂‘𝑁)𝑅(𝑂‘𝑀)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 198   ∧ wa 386   = wceq 1656   ∈ wcel 2164  ∀wral 3117  ∃wrex 3118  {crab 3121  Vcvv 3414   ∩ cin 3797   ⊆ wss 3798   class class class wbr 4875   ↦ cmpt 4954   Se wse 5303   We wwe 5304  dom cdm 5346  ran crn 5347   ↾ cres 5348   “ cima 5349  Ord word 5966  Oncon0 5967  Lim wlim 5968  Fun wfun 6121   Fn wfn 6122  ‘cfv 6127  ℩crio 6870  recscrecs 7738  OrdIsocoi 8690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-8 2166  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-sep 5007  ax-nul 5015  ax-pow 5067  ax-pr 5129  ax-un 7214

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3or 1112  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rmo 3125  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-pss 3814  df-nul 4147  df-if 4309  df-pw 4382  df-sn 4400  df-pr 4402  df-tp 4404  df-op 4406  df-uni 4661  df-iun 4744  df-br 4876  df-opab 4938  df-mpt 4955  df-tr 4978  df-id 5252  df-eprel 5257  df-po 5265  df-so 5266  df-fr 5305  df-se 5306  df-we 5307  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-res 5358  df-ima 5359  df-pred 5924  df-ord 5970  df-on 5971  df-lim 5972  df-suc 5973  df-iota 6090  df-fun 6129  df-fn 6130  df-f 6131  df-f1 6132  df-fo 6133  df-f1o 6134  df-fv 6135  df-riota 6871  df-wrecs 7677  df-recs 7739  df-oi 8691

This theorem is referenced by:  ordtypelem8  8706