noinfres - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > noinfres		Structured version Visualization version GIF version

Theorem noinfres 28079

Description: The restriction of surreal infimum when there is no minimum. (Contributed by Scott Fenton, 8-Aug-2024.)

**Hypothesis**
Ref	Expression
noinfres.1	⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))

**Assertion**
Ref	Expression
noinfres	⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (𝑇 ↾ suc 𝐺) = (𝑈 ↾ suc 𝐺))

Distinct variable groups: 𝑢,𝐵,𝑣,𝑦,𝑔,𝑥 𝑔,𝑉 𝑣,𝐺 𝑢,𝑈,𝑣,𝑥 Allowed substitution hints: 𝑇(𝑥, 𝑦, 𝑣, 𝑢, 𝑔) 𝑈(𝑦, 𝑔) 𝐺(𝑥, 𝑦, 𝑢, 𝑔) 𝑉(𝑥, 𝑦, 𝑣, 𝑢)

Proof of Theorem noinfres Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmres 6003	. . . 4 ⊢ dom (𝑇 ↾ suc 𝐺) = (suc 𝐺 ∩ dom 𝑇)
2		noinfres.1	. . . . . . . . 9 ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
3	2	noinfno 28075	. . . . . . . 8 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) → 𝑇 ∈ No)
4	3	3ad2ant2 1152	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝑇 ∈ No)
5		nodmord 28010	. . . . . . 7 ⊢ (𝑇 ∈ No → Ord dom 𝑇)
6	4, 5	syl 18	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Ord dom 𝑇)
7		simp31 1228	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝑈 ∈ 𝐵)
8		simp32 1229	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝐺 ∈ dom 𝑈)
9		simp33 1230	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))
10		dmeq 5885	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑈 → dom 𝑏 = dom 𝑈)
11	10	eleq2d 2847	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑈 → (𝐺 ∈ dom 𝑏 ↔ 𝐺 ∈ dom 𝑈))
12		breq1 5106	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = 𝑈 → (𝑏 <s 𝑐 ↔ 𝑈 <s 𝑐))
13	12	notbid 321	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑈 → (¬ 𝑏 <s 𝑐 ↔ ¬ 𝑈 <s 𝑐))
14		reseq1 5964	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = 𝑈 → (𝑏 ↾ suc 𝐺) = (𝑈 ↾ suc 𝐺))
15	14	eqeq1d 2763	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑈 → ((𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺) ↔ (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))
16	13, 15	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑈 → ((¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ (¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
17	16	ralbidv 3186	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑈 → (∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ ∀𝑐 ∈ 𝐵 (¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
18		breq2 5107	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = 𝑣 → (𝑈 <s 𝑐 ↔ 𝑈 <s 𝑣))
19	18	notbid 321	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑣 → (¬ 𝑈 <s 𝑐 ↔ ¬ 𝑈 <s 𝑣))
20		reseq1 5964	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = 𝑣 → (𝑐 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺))
21	20	eqeq2d 2772	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑣 → ((𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺) ↔ (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))
22	19, 21	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑣 → ((¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺))))
23	22	cbvralvw 3241	. . . . . . . . . . . 12 ⊢ (∀𝑐 ∈ 𝐵 (¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))
24	17, 23	bitrdi 290	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑈 → (∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺))))
25	11, 24	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑏 = 𝑈 → ((𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))) ↔ (𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))))
26	25	rspcev 3577	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐵 ∧ (𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → ∃𝑏 ∈ 𝐵 (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
27	7, 8, 9, 26	syl12anc 850	. . . . . . . 8 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → ∃𝑏 ∈ 𝐵 (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
28		eleq1 2849	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐺 → (𝑎 ∈ dom 𝑏 ↔ 𝐺 ∈ dom 𝑏))
29		suceq 6431	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = 𝐺 → suc 𝑎 = suc 𝐺)
30	29	reseq2d 5970	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝐺 → (𝑏 ↾ suc 𝑎) = (𝑏 ↾ suc 𝐺))
31	29	reseq2d 5970	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝐺 → (𝑐 ↾ suc 𝑎) = (𝑐 ↾ suc 𝐺))
32	30, 31	eqeq12d 2777	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝐺 → ((𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎) ↔ (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))
33	32	imbi2d 343	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐺 → ((¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)) ↔ (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
34	33	ralbidv 3186	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐺 → (∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)) ↔ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
35	28, 34	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐺 → ((𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎))) ↔ (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))))
36	35	rexbidv 3187	. . . . . . . . . 10 ⊢ (𝑎 = 𝐺 → (∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎))) ↔ ∃𝑏 ∈ 𝐵 (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))))
37	36	elabg 3630	. . . . . . . . 9 ⊢ (𝐺 ∈ dom 𝑈 → (𝐺 ∈ {𝑎 ∣ ∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)))} ↔ ∃𝑏 ∈ 𝐵 (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))))
38	8, 37	syl 18	. . . . . . . 8 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (𝐺 ∈ {𝑎 ∣ ∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)))} ↔ ∃𝑏 ∈ 𝐵 (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))))
39	27, 38	mpbird 260	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝐺 ∈ {𝑎 ∣ ∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)))})
40	2	noinfdm 28076	. . . . . . . 8 ⊢ (¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 → dom 𝑇 = {𝑎 ∣ ∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)))})
41	40	3ad2ant1 1151	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom 𝑇 = {𝑎 ∣ ∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)))})
42	39, 41	eleqtrrd 2864	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝐺 ∈ dom 𝑇)
43		ordsucss 7829	. . . . . 6 ⊢ (Ord dom 𝑇 → (𝐺 ∈ dom 𝑇 → suc 𝐺 ⊆ dom 𝑇))
44	6, 42, 43	sylc 66	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → suc 𝐺 ⊆ dom 𝑇)
45		dfss2 3917	. . . . 5 ⊢ (suc 𝐺 ⊆ dom 𝑇 ↔ (suc 𝐺 ∩ dom 𝑇) = suc 𝐺)
46	44, 45	sylib 221	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (suc 𝐺 ∩ dom 𝑇) = suc 𝐺)
47	1, 46	eqtrid 2808	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom (𝑇 ↾ suc 𝐺) = suc 𝐺)
48		dmres 6003	. . . 4 ⊢ dom (𝑈 ↾ suc 𝐺) = (suc 𝐺 ∩ dom 𝑈)
49		simp2l 1218	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝐵 ⊆ No)
50	49, 7	sseldd 3932	. . . . . . . 8 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝑈 ∈ No)
51		nodmon 28007	. . . . . . . 8 ⊢ (𝑈 ∈ No → dom 𝑈 ∈ On)
52	50, 51	syl 18	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom 𝑈 ∈ On)
53		eloni 6372	. . . . . . 7 ⊢ (dom 𝑈 ∈ On → Ord dom 𝑈)
54	52, 53	syl 18	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Ord dom 𝑈)
55		ordsucss 7829	. . . . . 6 ⊢ (Ord dom 𝑈 → (𝐺 ∈ dom 𝑈 → suc 𝐺 ⊆ dom 𝑈))
56	54, 8, 55	sylc 66	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → suc 𝐺 ⊆ dom 𝑈)
57		dfss2 3917	. . . . 5 ⊢ (suc 𝐺 ⊆ dom 𝑈 ↔ (suc 𝐺 ∩ dom 𝑈) = suc 𝐺)
58	56, 57	sylib 221	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (suc 𝐺 ∩ dom 𝑈) = suc 𝐺)
59	48, 58	eqtrid 2808	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom (𝑈 ↾ suc 𝐺) = suc 𝐺)
60	47, 59	eqtr4d 2799	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom (𝑇 ↾ suc 𝐺) = dom (𝑈 ↾ suc 𝐺))
61	47	eleq2d 2847	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (𝑎 ∈ dom (𝑇 ↾ suc 𝐺) ↔ 𝑎 ∈ suc 𝐺))
62		simpl1 1210	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥)
63		simpl2 1211	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉))
64		simpl31 1273	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝑈 ∈ 𝐵)
65	56	sselda 3931	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝑎 ∈ dom 𝑈)
66	50	adantr 486	. . . . . . . . . . . . 13 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝑈 ∈ No)
67	66, 51	syl 18	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → dom 𝑈 ∈ On)
68		simpl32 1274	. . . . . . . . . . . 12 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝐺 ∈ dom 𝑈)
69		onelon 6387	. . . . . . . . . . . 12 ⊢ ((dom 𝑈 ∈ On ∧ 𝐺 ∈ dom 𝑈) → 𝐺 ∈ On)
70	67, 68, 69	syl2anc 596	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝐺 ∈ On)
71		onsucb 7828	. . . . . . . . . . 11 ⊢ (𝐺 ∈ On ↔ suc 𝐺 ∈ On)
72	70, 71	sylib 221	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → suc 𝐺 ∈ On)
73		eloni 6372	. . . . . . . . . 10 ⊢ (suc 𝐺 ∈ On → Ord suc 𝐺)
74	72, 73	syl 18	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → Ord suc 𝐺)
75		simpr 490	. . . . . . . . 9 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝑎 ∈ suc 𝐺)
76		ordsucss 7829	. . . . . . . . 9 ⊢ (Ord suc 𝐺 → (𝑎 ∈ suc 𝐺 → suc 𝑎 ⊆ suc 𝐺))
77	74, 75, 76	sylc 66	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → suc 𝑎 ⊆ suc 𝐺)
78		simpl33 1275	. . . . . . . 8 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))
79		reseq1 5964	. . . . . . . . . . 11 ⊢ ((𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺) → ((𝑈 ↾ suc 𝐺) ↾ suc 𝑎) = ((𝑣 ↾ suc 𝐺) ↾ suc 𝑎))
80		resabs1 5997	. . . . . . . . . . . 12 ⊢ (suc 𝑎 ⊆ suc 𝐺 → ((𝑈 ↾ suc 𝐺) ↾ suc 𝑎) = (𝑈 ↾ suc 𝑎))
81		resabs1 5997	. . . . . . . . . . . 12 ⊢ (suc 𝑎 ⊆ suc 𝐺 → ((𝑣 ↾ suc 𝐺) ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎))
82	80, 81	eqeq12d 2777	. . . . . . . . . . 11 ⊢ (suc 𝑎 ⊆ suc 𝐺 → (((𝑈 ↾ suc 𝐺) ↾ suc 𝑎) = ((𝑣 ↾ suc 𝐺) ↾ suc 𝑎) ↔ (𝑈 ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎)))
83	79, 82	imbitrid 247	. . . . . . . . . 10 ⊢ (suc 𝑎 ⊆ suc 𝐺 → ((𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺) → (𝑈 ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎)))
84	83	imim2d 58	. . . . . . . . 9 ⊢ (suc 𝑎 ⊆ suc 𝐺 → ((¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)) → (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎))))
85	84	ralimdv 3177	. . . . . . . 8 ⊢ (suc 𝑎 ⊆ suc 𝐺 → (∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)) → ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎))))
86	77, 78, 85	sylc 66	. . . . . . 7 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎)))
87	2	noinffv 28078	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝑎 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎)))) → (𝑇‘𝑎) = (𝑈‘𝑎))
88	62, 63, 64, 65, 86, 87	syl113anc 1409	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → (𝑇‘𝑎) = (𝑈‘𝑎))
89	75	fvresd 6905	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ((𝑇 ↾ suc 𝐺)‘𝑎) = (𝑇‘𝑎))
90	75	fvresd 6905	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ((𝑈 ↾ suc 𝐺)‘𝑎) = (𝑈‘𝑎))
91	88, 89, 90	3eqtr4d 2806	. . . . 5 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎))
92	91	ex 418	. . . 4 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (𝑎 ∈ suc 𝐺 → ((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎)))
93	61, 92	sylbid 243	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (𝑎 ∈ dom (𝑇 ↾ suc 𝐺) → ((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎)))
94	93	ralrimiv 3154	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → ∀𝑎 ∈ dom (𝑇 ↾ suc 𝐺)((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎))
95		nofun 28006	. . . . 5 ⊢ (𝑇 ∈ No → Fun 𝑇)
96	95	funresd 6583	. . . 4 ⊢ (𝑇 ∈ No → Fun (𝑇 ↾ suc 𝐺))
97	4, 96	syl 18	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Fun (𝑇 ↾ suc 𝐺))
98		nofun 28006	. . . . 5 ⊢ (𝑈 ∈ No → Fun 𝑈)
99	98	funresd 6583	. . . 4 ⊢ (𝑈 ∈ No → Fun (𝑈 ↾ suc 𝐺))
100	50, 99	syl 18	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Fun (𝑈 ↾ suc 𝐺))
101		eqfunfv 7035	. . 3 ⊢ ((Fun (𝑇 ↾ suc 𝐺) ∧ Fun (𝑈 ↾ suc 𝐺)) → ((𝑇 ↾ suc 𝐺) = (𝑈 ↾ suc 𝐺) ↔ (dom (𝑇 ↾ suc 𝐺) = dom (𝑈 ↾ suc 𝐺) ∧ ∀𝑎 ∈ dom (𝑇 ↾ suc 𝐺)((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎))))
102	97, 100, 101	syl2anc 596	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → ((𝑇 ↾ suc 𝐺) = (𝑈 ↾ suc 𝐺) ↔ (dom (𝑇 ↾ suc 𝐺) = dom (𝑈 ↾ suc 𝐺) ∧ ∀𝑎 ∈ dom (𝑇 ↾ suc 𝐺)((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎))))
103	60, 94, 102	mpbir2and 726	1 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → (𝑇 ↾ suc 𝐺) = (𝑈 ↾ suc 𝐺))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {cab 2739 ∀wral 3077 ∃wrex 3087 ∪ cun 3897 ∩ cin 3898 ⊆ wss 3899 ifcif 4482 {csn 4584 ⟨cop 4590 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 ↾ cres 5653 Ord word 6361 Oncon0 6362 suc csuc 6364 ℩cio 6492 Fun wfun 6532 ‘cfv 6538 ℩crio 7376 1_oc1o 8469 Nocsur 27997 <s clts 27998

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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-riota 7377 df-1o 8476 df-2o 8477 df-no 28000 df-lts 28001 df-bday 28002

This theorem is used by: noinfbnd1lem1 28080 noinfbnd2 28088

W3C validator