nosupcbv - Metamath Proof Explorer

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

Theorem nosupcbv 28059

Description: Lemma to change bound variables in a surreal supremum. (Contributed by Scott Fenton, 9-Aug-2024.)

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

**Assertion**
Ref	Expression
nosupcbv	⊢ 𝑆 = if(∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏, ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩}), (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))))

Distinct variable groups: 𝐴,𝑎,𝑐,𝑒,𝑔,𝑢,𝑣,𝑦 𝐴,𝑑,𝑓,𝑐,𝑒,𝑢,𝑣,𝑦 𝐴,𝑏,𝑥,𝑎,𝑦 𝑥,𝑐,𝑒 𝑓,𝑔,𝑥,𝑢 Allowed substitution hints: 𝑆(𝑥, 𝑦, 𝑣, 𝑢, 𝑒, 𝑓, 𝑔, 𝑎, 𝑏, 𝑐, 𝑑)

**Proof of Theorem nosupcbv**
Step	Hyp	Ref	Expression
1		nosupcbv.1	. 2 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
2		breq1 5105	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (𝑥 <s 𝑦 ↔ 𝑎 <s 𝑦))
3	2	notbid 321	. . . . . 6 ⊢ (𝑥 = 𝑎 → (¬ 𝑥 <s 𝑦 ↔ ¬ 𝑎 <s 𝑦))
4	3	ralbidv 3185	. . . . 5 ⊢ (𝑥 = 𝑎 → (∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑎 <s 𝑦))
5		breq2 5106	. . . . . . 7 ⊢ (𝑦 = 𝑏 → (𝑎 <s 𝑦 ↔ 𝑎 <s 𝑏))
6	5	notbid 321	. . . . . 6 ⊢ (𝑦 = 𝑏 → (¬ 𝑎 <s 𝑦 ↔ ¬ 𝑎 <s 𝑏))
7	6	cbvralvw 3240	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑎 <s 𝑦 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
8	4, 7	bitrdi 290	. . . 4 ⊢ (𝑥 = 𝑎 → (∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏))
9	8	cbvrexvw 3241	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
10	8	cbvriotavw 7387	. . . 4 ⊢ (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) = (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
11	10	dmeqi 5885	. . . . . 6 ⊢ dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) = dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
12	11	opeq1i 4835	. . . . 5 ⊢ ⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩ = ⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩
13	12	sneqi 4594	. . . 4 ⊢ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩} = {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩}
14	10, 13	uneq12i 4165	. . 3 ⊢ ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩}) = ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩})
15		eleq1w 2843	. . . . . . . . 9 ⊢ (𝑔 = 𝑐 → (𝑔 ∈ dom 𝑢 ↔ 𝑐 ∈ dom 𝑢))
16		suceq 6431	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑐 → suc 𝑔 = suc 𝑐)
17	16	reseq2d 5969	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑐 → (𝑢 ↾ suc 𝑔) = (𝑢 ↾ suc 𝑐))
18	16	reseq2d 5969	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑐 → (𝑣 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑐))
19	17, 18	eqeq12d 2776	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑐 → ((𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔) ↔ (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)))
20	19	imbi2d 343	. . . . . . . . . 10 ⊢ (𝑔 = 𝑐 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ↔ (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
21	20	ralbidv 3185	. . . . . . . . 9 ⊢ (𝑔 = 𝑐 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
22		fveqeq2 6894	. . . . . . . . 9 ⊢ (𝑔 = 𝑐 → ((𝑢‘𝑔) = 𝑥 ↔ (𝑢‘𝑐) = 𝑥))
23	15, 21, 22	3anbi123d 1464	. . . . . . . 8 ⊢ (𝑔 = 𝑐 → ((𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥) ↔ (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)))
24	23	rexbidv 3186	. . . . . . 7 ⊢ (𝑔 = 𝑐 → (∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥) ↔ ∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)))
25	24	iotabidv 6522	. . . . . 6 ⊢ (𝑔 = 𝑐 → (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)) = (℩𝑥∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)))
26		eqeq2 2772	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → ((𝑢‘𝑐) = 𝑥 ↔ (𝑢‘𝑐) = 𝑎))
27	26	3anbi3d 1470	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → ((𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥) ↔ (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎)))
28	27	rexbidv 3186	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥) ↔ ∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎)))
29		dmeq 5884	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → dom 𝑢 = dom 𝑒)
30	29	eleq2d 2846	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → (𝑐 ∈ dom 𝑢 ↔ 𝑐 ∈ dom 𝑒))
31		breq2 5106	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑒 → (𝑣 <s 𝑢 ↔ 𝑣 <s 𝑒))
32	31	notbid 321	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑒 → (¬ 𝑣 <s 𝑢 ↔ ¬ 𝑣 <s 𝑒))
33		reseq1 5963	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑒 → (𝑢 ↾ suc 𝑐) = (𝑒 ↾ suc 𝑐))
34	33	eqeq1d 2762	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑒 → ((𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐) ↔ (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)))
35	32, 34	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑒 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
36	35	ralbidv 3185	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
37		breq1 5105	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑓 → (𝑣 <s 𝑒 ↔ 𝑓 <s 𝑒))
38	37	notbid 321	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑓 → (¬ 𝑣 <s 𝑒 ↔ ¬ 𝑓 <s 𝑒))
39		reseq1 5963	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑓 → (𝑣 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐))
40	39	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑓 → ((𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐) ↔ (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)))
41	38, 40	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑓 → ((¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐))))
42	41	cbvralvw 3240	. . . . . . . . . . 11 ⊢ (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)))
43	36, 42	bitrdi 290	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐))))
44		fveq1 6884	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → (𝑢‘𝑐) = (𝑒‘𝑐))
45	44	eqeq1d 2762	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → ((𝑢‘𝑐) = 𝑎 ↔ (𝑒‘𝑐) = 𝑎))
46	30, 43, 45	3anbi123d 1464	. . . . . . . . 9 ⊢ (𝑢 = 𝑒 → ((𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎) ↔ (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
47	46	cbvrexvw 3241	. . . . . . . 8 ⊢ (∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎) ↔ ∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))
48	28, 47	bitrdi 290	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥) ↔ ∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
49	48	cbviotavw 6502	. . . . . 6 ⊢ (℩𝑥∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)) = (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))
50	25, 49	eqtrdi 2811	. . . . 5 ⊢ (𝑔 = 𝑐 → (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)) = (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
51	50	cbvmptv 5208	. . . 4 ⊢ (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))) = (𝑐 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
52		eleq1w 2843	. . . . . . . . 9 ⊢ (𝑦 = 𝑑 → (𝑦 ∈ dom 𝑢 ↔ 𝑑 ∈ dom 𝑢))
53		suceq 6431	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑑 → suc 𝑦 = suc 𝑑)
54	53	reseq2d 5969	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑑 → (𝑢 ↾ suc 𝑦) = (𝑢 ↾ suc 𝑑))
55	53	reseq2d 5969	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑑 → (𝑣 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑑))
56	54, 55	eqeq12d 2776	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑑 → ((𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦) ↔ (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))
57	56	imbi2d 343	. . . . . . . . . 10 ⊢ (𝑦 = 𝑑 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)) ↔ (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
58	57	ralbidv 3185	. . . . . . . . 9 ⊢ (𝑦 = 𝑑 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
59	52, 58	anbi12d 644	. . . . . . . 8 ⊢ (𝑦 = 𝑑 → ((𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ (𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))))
60	59	rexbidv 3186	. . . . . . 7 ⊢ (𝑦 = 𝑑 → (∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ ∃𝑢 ∈ 𝐴 (𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))))
61	29	eleq2d 2846	. . . . . . . . 9 ⊢ (𝑢 = 𝑒 → (𝑑 ∈ dom 𝑢 ↔ 𝑑 ∈ dom 𝑒))
62		reseq1 5963	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑒 → (𝑢 ↾ suc 𝑑) = (𝑒 ↾ suc 𝑑))
63	62	eqeq1d 2762	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑒 → ((𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑) ↔ (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))
64	32, 63	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
65	64	ralbidv 3185	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
66		reseq1 5963	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑓 → (𝑣 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))
67	66	eqeq2d 2771	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑓 → ((𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑) ↔ (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))
68	38, 67	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑓 → ((¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))))
69	68	cbvralvw 3240	. . . . . . . . . 10 ⊢ (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))
70	65, 69	bitrdi 290	. . . . . . . . 9 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))))
71	61, 70	anbi12d 644	. . . . . . . 8 ⊢ (𝑢 = 𝑒 → ((𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))) ↔ (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))))
72	71	cbvrexvw 3241	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝐴 (𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))) ↔ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))))
73	60, 72	bitrdi 290	. . . . . 6 ⊢ (𝑦 = 𝑑 → (∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))))
74	73	cbvabv 2830	. . . . 5 ⊢ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} = {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))}
75	74	mpteq1i 5195	. . . 4 ⊢ (𝑐 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))) = (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
76	51, 75	eqtri 2783	. . 3 ⊢ (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))) = (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
77	9, 14, 76	ifbieq12i 4509	. 2 ⊢ if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)))) = if(∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏, ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩}), (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))))
78	1, 77	eqtri 2783	1 ⊢ 𝑆 = if(∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏, ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩}), (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 {cab 2738 ∀wral 3076 ∃wrex 3086 ∪ cun 4149 ifcif 4481 {csn 4583 ⟨cop 4589 class class class wbr 5102 ↦ cmpt 5185 dom cdm 5650 ↾ cres 5652 suc csuc 6364 ℩cio 6492 ‘cfv 6538 ℩crio 7376 2_oc2o 8470 <s clts 27998

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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-xp 5656 df-dm 5660 df-res 5662 df-suc 6368 df-iota 6494 df-fv 6546 df-riota 7377

This theorem is used by: noeta 28100

W3C validator