Theorem ordtypelem3 9496

Description: Lemma for ordtype 9508. (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
ordtypelem3	⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})

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

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

Proof of Theorem ordtypelem3

Step	Hyp	Ref	Expression
1		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → 𝑀 ∈ (𝑇 ∩ dom 𝐹))
2	1	elin2d 4154	. . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → 𝑀 ∈ dom 𝐹)
3		ordtypelem.1	. . . . 5 ⊢ 𝐹 = recs(𝐺)
4	3	tfr2a 8388	. . . 4 ⊢ (𝑀 ∈ dom 𝐹 → (𝐹‘𝑀) = (𝐺‘(𝐹 ↾ 𝑀)))
5	2, 4	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) = (𝐺‘(𝐹 ↾ 𝑀)))
6	3	tfr1a 8387	. . . . . . . . 9 ⊢ (Fun 𝐹 ∧ Lim dom 𝐹)
7	6	simpri 491	. . . . . . . 8 ⊢ Lim dom 𝐹
8		limord 6423	. . . . . . . 8 ⊢ (Lim dom 𝐹 → Ord dom 𝐹)
9	7, 8	ax-mp 5	. . . . . . 7 ⊢ Ord dom 𝐹
10		ordelord 6383	. . . . . . 7 ⊢ ((Ord dom 𝐹 ∧ 𝑀 ∈ dom 𝐹) → Ord 𝑀)
11	9, 2, 10	sylancr 599	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → Ord 𝑀)
12	3	tfr2b 8389	. . . . . 6 ⊢ (Ord 𝑀 → (𝑀 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑀) ∈ V))
13	11, 12	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝑀 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑀) ∈ V))
14	2, 13	mpbid 235	. . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹 ↾ 𝑀) ∈ V)
15		ordtypelem.2	. . . . . . 7 ⊢ 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
16		rneq 5924	. . . . . . . . . 10 ⊢ (ℎ = (𝐹 ↾ 𝑀) → ran ℎ = ran (𝐹 ↾ 𝑀))
17		df-ima 5672	. . . . . . . . . 10 ⊢ (𝐹 “ 𝑀) = ran (𝐹 ↾ 𝑀)
18	16, 17	eqtr4di 2815	. . . . . . . . 9 ⊢ (ℎ = (𝐹 ↾ 𝑀) → ran ℎ = (𝐹 “ 𝑀))
19	18	raleqdv 3321	. . . . . . . 8 ⊢ (ℎ = (𝐹 ↾ 𝑀) → (∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤 ↔ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤))
20	19	rabbidv 3421	. . . . . . 7 ⊢ (ℎ = (𝐹 ↾ 𝑀) → {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤})
21	15, 20	eqtrid 2809	. . . . . 6 ⊢ (ℎ = (𝐹 ↾ 𝑀) → 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤})
22	21	raleqdv 3321	. . . . . 6 ⊢ (ℎ = (𝐹 ↾ 𝑀) → (∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣 ↔ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
23	21, 22	riotaeqbidv 7377	. . . . 5 ⊢ (ℎ = (𝐹 ↾ 𝑀) → (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣) = (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
24		ordtypelem.3	. . . . 5 ⊢ 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
25		riotaex 7378	. . . . 5 ⊢ (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣) ∈ V
26	23, 24, 25	fvmpt 6990	. . . 4 ⊢ ((𝐹 ↾ 𝑀) ∈ V → (𝐺‘(𝐹 ↾ 𝑀)) = (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
27	14, 26	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐺‘(𝐹 ↾ 𝑀)) = (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
28	5, 27	eqtrd 2797	. 2 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) = (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
29		ordtypelem.7	. . . . 5 ⊢ (𝜑 → 𝑅 We 𝐴)
30	29	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → 𝑅 We 𝐴)
31		ordtypelem.8	. . . . 5 ⊢ (𝜑 → 𝑅 Se 𝐴)
32	31	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → 𝑅 Se 𝐴)
33		ssrab2 4031	. . . . 5 ⊢ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ⊆ 𝐴
34	33	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ⊆ 𝐴)
35	1	elin1d 4153	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → 𝑀 ∈ 𝑇)
36		imaeq2 6056	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑀 → (𝐹 “ 𝑥) = (𝐹 “ 𝑀))
37	36	raleqdv 3321	. . . . . . . . . 10 ⊢ (𝑥 = 𝑀 → (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡))
38	37	rexbidv 3188	. . . . . . . . 9 ⊢ (𝑥 = 𝑀 → (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡))
39		ordtypelem.5	. . . . . . . . 9 ⊢ 𝑇 = {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡}
40	38, 39	elrab2 3652	. . . . . . . 8 ⊢ (𝑀 ∈ 𝑇 ↔ (𝑀 ∈ On ∧ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡))
41	40	simprbi 503	. . . . . . 7 ⊢ (𝑀 ∈ 𝑇 → ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡)
42	35, 41	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡)
43		breq1 5110	. . . . . . . . 9 ⊢ (𝑗 = 𝑧 → (𝑗𝑅𝑤 ↔ 𝑧𝑅𝑤))
44	43	cbvralvw 3242	. . . . . . . 8 ⊢ (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤 ↔ ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑤)
45		breq2 5111	. . . . . . . . 9 ⊢ (𝑤 = 𝑡 → (𝑧𝑅𝑤 ↔ 𝑧𝑅𝑡))
46	45	ralbidv 3187	. . . . . . . 8 ⊢ (𝑤 = 𝑡 → (∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑤 ↔ ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡))
47	44, 46	bitrid 286	. . . . . . 7 ⊢ (𝑤 = 𝑡 → (∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤 ↔ ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡))
48	47	cbvrexvw 3243	. . . . . 6 ⊢ (∃𝑤 ∈ 𝐴 ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤 ↔ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑀)𝑧𝑅𝑡)
49	42, 48	sylibr 237	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → ∃𝑤 ∈ 𝐴 ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤)
50		rabn0 4342	. . . . 5 ⊢ ({𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ≠ ∅ ↔ ∃𝑤 ∈ 𝐴 ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤)
51	49, 50	sylibr 237	. . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ≠ ∅)
52		wereu2 5656	. . . 4 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ ({𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ⊆ 𝐴 ∧ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ≠ ∅)) → ∃!𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)
53	30, 32, 34, 51, 52	syl22anc 852	. . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → ∃!𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)
54		riotacl2 7390	. . 3 ⊢ (∃!𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣 → (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
55	53, 54	syl 18	. 2 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (℩𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤}∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})
56	28, 55	eqeltrd 2862	1 ⊢ ((𝜑 ∧ 𝑀 ∈ (𝑇 ∩ dom 𝐹)) → (𝐹‘𝑀) ∈ {𝑣 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ∣ ∀𝑢 ∈ {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ (𝐹 “ 𝑀)𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣})

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  ∃!wreu 3365  {crab 3414  Vcvv 3453   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282   class class class wbr 5107   ↦ cmpt 5190   Se wse 5610   We wwe 5611  dom cdm 5659  ran crn 5660   ↾ cres 5661   “ cima 5662  Ord word 6360  Oncon0 6361  Lim wlim 6362  Fun wfun 6531  ‘cfv 6537  ℩crio 7373  recscrecs 8363  OrdIsocoi 9485

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364

This theorem is used by:  ordtypelem4  9497  ordtypelem6  9499  ordtypelem7  9500