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 28091

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 6008	. . . 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 28087	. . . . . . . 8 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) → 𝑇 ∈ No)
4	3	3ad2ant2 1152	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝑇 ∈ No)
5		nodmord 28022	. . . . . . 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 5889	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑈 → dom 𝑏 = dom 𝑈)
11	10	eleq2d 2849	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑈 → (𝐺 ∈ dom 𝑏 ↔ 𝐺 ∈ dom 𝑈))
12		breq1 5108	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = 𝑈 → (𝑏 <s 𝑐 ↔ 𝑈 <s 𝑐))
13	12	notbid 321	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑈 → (¬ 𝑏 <s 𝑐 ↔ ¬ 𝑈 <s 𝑐))
14		reseq1 5968	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = 𝑈 → (𝑏 ↾ suc 𝐺) = (𝑈 ↾ suc 𝐺))
15	14	eqeq1d 2765	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑈 → ((𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺) ↔ (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))
16	13, 15	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑈 → ((¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ (¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
17	16	ralbidv 3188	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑈 → (∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ ∀𝑐 ∈ 𝐵 (¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
18		breq2 5109	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = 𝑣 → (𝑈 <s 𝑐 ↔ 𝑈 <s 𝑣))
19	18	notbid 321	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑣 → (¬ 𝑈 <s 𝑐 ↔ ¬ 𝑈 <s 𝑣))
20		reseq1 5968	. . . . . . . . . . . . . . 15 ⊢ (𝑐 = 𝑣 → (𝑐 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺))
21	20	eqeq2d 2774	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑣 → ((𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺) ↔ (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))
22	19, 21	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑣 → ((¬ 𝑈 <s 𝑐 → (𝑈 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)) ↔ (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺))))
23	22	cbvralvw 3243	. . . . . . . . . . . 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 3579	. . . . . . . . 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 2851	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐺 → (𝑎 ∈ dom 𝑏 ↔ 𝐺 ∈ dom 𝑏))
29		suceq 6437	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = 𝐺 → suc 𝑎 = suc 𝐺)
30	29	reseq2d 5974	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝐺 → (𝑏 ↾ suc 𝑎) = (𝑏 ↾ suc 𝐺))
31	29	reseq2d 5974	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝐺 → (𝑐 ↾ suc 𝑎) = (𝑐 ↾ suc 𝐺))
32	30, 31	eqeq12d 2779	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝐺 → ((𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎) ↔ (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))
33	32	imbi2d 343	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐺 → ((¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)) ↔ (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
34	33	ralbidv 3188	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐺 → (∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎)) ↔ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺))))
35	28, 34	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐺 → ((𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎))) ↔ (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))))
36	35	rexbidv 3189	. . . . . . . . . 10 ⊢ (𝑎 = 𝐺 → (∃𝑏 ∈ 𝐵 (𝑎 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝑎) = (𝑐 ↾ suc 𝑎))) ↔ ∃𝑏 ∈ 𝐵 (𝐺 ∈ dom 𝑏 ∧ ∀𝑐 ∈ 𝐵 (¬ 𝑏 <s 𝑐 → (𝑏 ↾ suc 𝐺) = (𝑐 ↾ suc 𝐺)))))
37	36	elabg 3632	. . . . . . . . 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 28088	. . . . . . . 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 2866	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝐺 ∈ dom 𝑇)
43		ordsucss 7836	. . . . . 6 ⊢ (Ord dom 𝑇 → (𝐺 ∈ dom 𝑇 → suc 𝐺 ⊆ dom 𝑇))
44	6, 42, 43	sylc 66	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → suc 𝐺 ⊆ dom 𝑇)
45		dfss2 4096	. . . . 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 2810	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom (𝑇 ↾ suc 𝐺) = suc 𝐺)
48		dmres 6008	. . . 4 ⊢ dom (𝑈 ↾ suc 𝐺) = (suc 𝐺 ∩ dom 𝑈)
49		simp2l 1218	. . . . . . . . 9 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝐵 ⊆ No)
50	49, 7	sseldd 3913	. . . . . . . 8 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → 𝑈 ∈ No)
51		nodmon 28019	. . . . . . . 8 ⊢ (𝑈 ∈ No → dom 𝑈 ∈ On)
52	50, 51	syl 18	. . . . . . 7 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom 𝑈 ∈ On)
53		eloni 6378	. . . . . . 7 ⊢ (dom 𝑈 ∈ On → Ord dom 𝑈)
54	52, 53	syl 18	. . . . . 6 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Ord dom 𝑈)
55		ordsucss 7836	. . . . . 6 ⊢ (Ord dom 𝑈 → (𝐺 ∈ dom 𝑈 → suc 𝐺 ⊆ dom 𝑈))
56	54, 8, 55	sylc 66	. . . . 5 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → suc 𝐺 ⊆ dom 𝑈)
57		dfss2 4096	. . . . 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 2810	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom (𝑈 ↾ suc 𝐺) = suc 𝐺)
60	47, 59	eqtr4d 2801	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → dom (𝑇 ↾ suc 𝐺) = dom (𝑈 ↾ suc 𝐺))
61	47	eleq2d 2849	. . . 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 3912	. . . . . . 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 6393	. . . . . . . . . . . 12 ⊢ ((dom 𝑈 ∈ On ∧ 𝐺 ∈ dom 𝑈) → 𝐺 ∈ On)
70	67, 68, 69	syl2anc 596	. . . . . . . . . . 11 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → 𝐺 ∈ On)
71		onsucb 7835	. . . . . . . . . . 11 ⊢ (𝐺 ∈ On ↔ suc 𝐺 ∈ On)
72	70, 71	sylib 221	. . . . . . . . . 10 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → suc 𝐺 ∈ On)
73		eloni 6378	. . . . . . . . . 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 7836	. . . . . . . . 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 5968	. . . . . . . . . . 11 ⊢ ((𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺) → ((𝑈 ↾ suc 𝐺) ↾ suc 𝑎) = ((𝑣 ↾ suc 𝐺) ↾ suc 𝑎))
80		resabs1 6002	. . . . . . . . . . . 12 ⊢ (suc 𝑎 ⊆ suc 𝐺 → ((𝑈 ↾ suc 𝐺) ↾ suc 𝑎) = (𝑈 ↾ suc 𝑎))
81		resabs1 6002	. . . . . . . . . . . 12 ⊢ (suc 𝑎 ⊆ suc 𝐺 → ((𝑣 ↾ suc 𝐺) ↾ suc 𝑎) = (𝑣 ↾ suc 𝑎))
82	80, 81	eqeq12d 2779	. . . . . . . . . . 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 3179	. . . . . . . 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 28090	. . . . . . 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 6913	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ((𝑇 ↾ suc 𝐺)‘𝑎) = (𝑇‘𝑎))
90	75	fvresd 6913	. . . . . 6 ⊢ (((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) ∧ 𝑎 ∈ suc 𝐺) → ((𝑈 ↾ suc 𝐺)‘𝑎) = (𝑈‘𝑎))
91	88, 89, 90	3eqtr4d 2808	. . . . 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 3156	. 2 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → ∀𝑎 ∈ dom (𝑇 ↾ suc 𝐺)((𝑇 ↾ suc 𝐺)‘𝑎) = ((𝑈 ↾ suc 𝐺)‘𝑎))
95		nofun 28018	. . . . 5 ⊢ (𝑇 ∈ No → Fun 𝑇)
96	95	funresd 6591	. . . 4 ⊢ (𝑇 ∈ No → Fun (𝑇 ↾ suc 𝐺))
97	4, 96	syl 18	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Fun (𝑇 ↾ suc 𝐺))
98		nofun 28018	. . . . 5 ⊢ (𝑈 ∈ No → Fun 𝑈)
99	98	funresd 6591	. . . 4 ⊢ (𝑈 ∈ No → Fun (𝑈 ↾ suc 𝐺))
100	50, 99	syl 18	. . 3 ⊢ ((¬ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥 ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑉) ∧ (𝑈 ∈ 𝐵 ∧ 𝐺 ∈ dom 𝑈 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑈 <s 𝑣 → (𝑈 ↾ suc 𝐺) = (𝑣 ↾ suc 𝐺)))) → Fun (𝑈 ↾ suc 𝐺))
101		eqfunfv 7043	. . 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 1569 ∈ wcel 2146 {cab 2741 ∀wral 3079 ∃wrex 3089 ⊆ wss 3899 ∩ cin 4091 ∪ cun 4151 ifcif 4484 {csn 4587 ⟨cop 4837 class class class wbr 5105 ↦ cmpt 5188 dom cdm 5654 ↾ cres 5656 Ord word 6367 Oncon0 6368 suc csuc 6370 ℩cio 6498 Fun wfun 6540 ‘cfv 6546 ℩crio 7383 1_oc1o 8480 Nocsur 28009 <s clts 28010

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-ord 6371 df-on 6372 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-fo 6552 df-fv 6554 df-riota 7384 df-1o 8487 df-2o 8488 df-no 28012 df-lts 28013 df-bday 28014

This theorem is used by: noinfbnd1lem1 28092 noinfbnd2 28100

W3C validator