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 27768

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 320	. . . . . 6 ⊢ (𝑥 = 𝑎 → (¬ 𝑥 <s 𝑦 ↔ ¬ 𝑎 <s 𝑦))
4	3	ralbidv 3187	. . . . 5 ⊢ (𝑥 = 𝑎 → (∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑎 <s 𝑦))
5		breq2 5106	. . . . . . 7 ⊢ (𝑦 = 𝑏 → (𝑎 <s 𝑦 ↔ 𝑎 <s 𝑏))
6	5	notbid 320	. . . . . 6 ⊢ (𝑦 = 𝑏 → (¬ 𝑎 <s 𝑦 ↔ ¬ 𝑎 <s 𝑏))
7	6	cbvralvw 3242	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑎 <s 𝑦 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
8	4, 7	bitrdi 289	. . . 4 ⊢ (𝑥 = 𝑎 → (∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏))
9	8	cbvrexvw 3243	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦 ↔ ∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
10	8	cbvriotavw 7365	. . . 4 ⊢ (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) = (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
11	10	dmeqi 5882	. . . . . 6 ⊢ dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) = dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏)
12	11	opeq1i 4836	. . . . 5 ⊢ ⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩ = ⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩
13	12	sneqi 4595	. . . 4 ⊢ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩} = {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩}
14	10, 13	uneq12i 4121	. . 3 ⊢ ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2_o⟩}) = ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩})
15		eleq1w 2847	. . . . . . . . 9 ⊢ (𝑔 = 𝑐 → (𝑔 ∈ dom 𝑢 ↔ 𝑐 ∈ dom 𝑢))
16		suceq 6416	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑐 → suc 𝑔 = suc 𝑐)
17	16	reseq2d 5967	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑐 → (𝑢 ↾ suc 𝑔) = (𝑢 ↾ suc 𝑐))
18	16	reseq2d 5967	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑐 → (𝑣 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑐))
19	17, 18	eqeq12d 2780	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑐 → ((𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔) ↔ (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)))
20	19	imbi2d 342	. . . . . . . . . 10 ⊢ (𝑔 = 𝑐 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ↔ (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
21	20	ralbidv 3187	. . . . . . . . 9 ⊢ (𝑔 = 𝑐 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
22		fveqeq2 6878	. . . . . . . . 9 ⊢ (𝑔 = 𝑐 → ((𝑢‘𝑔) = 𝑥 ↔ (𝑢‘𝑐) = 𝑥))
23	15, 21, 22	3anbi123d 1459	. . . . . . . 8 ⊢ (𝑔 = 𝑐 → ((𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥) ↔ (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)))
24	23	rexbidv 3188	. . . . . . 7 ⊢ (𝑔 = 𝑐 → (∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥) ↔ ∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)))
25	24	iotabidv 6507	. . . . . 6 ⊢ (𝑔 = 𝑐 → (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)) = (℩𝑥∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)))
26		eqeq2 2776	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → ((𝑢‘𝑐) = 𝑥 ↔ (𝑢‘𝑐) = 𝑎))
27	26	3anbi3d 1465	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → ((𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥) ↔ (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎)))
28	27	rexbidv 3188	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥) ↔ ∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎)))
29		dmeq 5881	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → dom 𝑢 = dom 𝑒)
30	29	eleq2d 2850	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → (𝑐 ∈ dom 𝑢 ↔ 𝑐 ∈ dom 𝑒))
31		breq2 5106	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑒 → (𝑣 <s 𝑢 ↔ 𝑣 <s 𝑒))
32	31	notbid 320	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑒 → (¬ 𝑣 <s 𝑢 ↔ ¬ 𝑣 <s 𝑒))
33		reseq1 5961	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑒 → (𝑢 ↾ suc 𝑐) = (𝑒 ↾ suc 𝑐))
34	33	eqeq1d 2766	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑒 → ((𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐) ↔ (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)))
35	32, 34	imbi12d 346	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑒 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
36	35	ralbidv 3187	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐))))
37		breq1 5105	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑓 → (𝑣 <s 𝑒 ↔ 𝑓 <s 𝑒))
38	37	notbid 320	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑓 → (¬ 𝑣 <s 𝑒 ↔ ¬ 𝑓 <s 𝑒))
39		reseq1 5961	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑓 → (𝑣 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐))
40	39	eqeq2d 2775	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑓 → ((𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐) ↔ (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)))
41	38, 40	imbi12d 346	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑓 → ((¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐))))
42	41	cbvralvw 3242	. . . . . . . . . . 11 ⊢ (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)))
43	36, 42	bitrdi 289	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐))))
44		fveq1 6868	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → (𝑢‘𝑐) = (𝑒‘𝑐))
45	44	eqeq1d 2766	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → ((𝑢‘𝑐) = 𝑎 ↔ (𝑒‘𝑐) = 𝑎))
46	30, 43, 45	3anbi123d 1459	. . . . . . . . 9 ⊢ (𝑢 = 𝑒 → ((𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎) ↔ (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
47	46	cbvrexvw 3243	. . . . . . . 8 ⊢ (∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑎) ↔ ∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))
48	28, 47	bitrdi 289	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥) ↔ ∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
49	48	cbviotavw 6487	. . . . . 6 ⊢ (℩𝑥∃𝑢 ∈ 𝐴 (𝑐 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑐) = (𝑣 ↾ suc 𝑐)) ∧ (𝑢‘𝑐) = 𝑥)) = (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))
50	25, 49	eqtrdi 2815	. . . . 5 ⊢ (𝑔 = 𝑐 → (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)) = (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
51	50	cbvmptv 5206	. . . 4 ⊢ (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))) = (𝑐 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
52		eleq1w 2847	. . . . . . . . 9 ⊢ (𝑦 = 𝑑 → (𝑦 ∈ dom 𝑢 ↔ 𝑑 ∈ dom 𝑢))
53		suceq 6416	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑑 → suc 𝑦 = suc 𝑑)
54	53	reseq2d 5967	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑑 → (𝑢 ↾ suc 𝑦) = (𝑢 ↾ suc 𝑑))
55	53	reseq2d 5967	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑑 → (𝑣 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑑))
56	54, 55	eqeq12d 2780	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑑 → ((𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦) ↔ (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))
57	56	imbi2d 342	. . . . . . . . . 10 ⊢ (𝑦 = 𝑑 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)) ↔ (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
58	57	ralbidv 3187	. . . . . . . . 9 ⊢ (𝑦 = 𝑑 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
59	52, 58	anbi12d 641	. . . . . . . 8 ⊢ (𝑦 = 𝑑 → ((𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ (𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))))
60	59	rexbidv 3188	. . . . . . 7 ⊢ (𝑦 = 𝑑 → (∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ ∃𝑢 ∈ 𝐴 (𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))))
61	29	eleq2d 2850	. . . . . . . . 9 ⊢ (𝑢 = 𝑒 → (𝑑 ∈ dom 𝑢 ↔ 𝑑 ∈ dom 𝑒))
62		reseq1 5961	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑒 → (𝑢 ↾ suc 𝑑) = (𝑒 ↾ suc 𝑑))
63	62	eqeq1d 2766	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑒 → ((𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑) ↔ (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)))
64	32, 63	imbi12d 346	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑒 → ((¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
65	64	ralbidv 3187	. . . . . . . . . 10 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))))
66		reseq1 5961	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑓 → (𝑣 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))
67	66	eqeq2d 2775	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑓 → ((𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑) ↔ (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))
68	38, 67	imbi12d 346	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑓 → ((¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))))
69	68	cbvralvw 3242	. . . . . . . . . 10 ⊢ (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))
70	65, 69	bitrdi 289	. . . . . . . . 9 ⊢ (𝑢 = 𝑒 → (∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑)) ↔ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))))
71	61, 70	anbi12d 641	. . . . . . . 8 ⊢ (𝑢 = 𝑒 → ((𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))) ↔ (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))))
72	71	cbvrexvw 3243	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝐴 (𝑑 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑑) = (𝑣 ↾ suc 𝑑))) ↔ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑))))
73	60, 72	bitrdi 289	. . . . . 6 ⊢ (𝑦 = 𝑑 → (∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦))) ↔ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))))
74	73	cbvabv 2834	. . . . 5 ⊢ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} = {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))}
75	74	mpteq1i 5193	. . . 4 ⊢ (𝑐 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))) = (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
76	51, 75	eqtri 2787	. . 3 ⊢ (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))) = (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎)))
77	9, 14, 76	ifbieq12i 4510	. 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 2787	1 ⊢ 𝑆 = if(∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏, ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2_o⟩}), (𝑐 ∈ {𝑑 ∣ ∃𝑒 ∈ 𝐴 (𝑑 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑑) = (𝑓 ↾ suc 𝑑)))} ↦ (℩𝑎∃𝑒 ∈ 𝐴 (𝑐 ∈ dom 𝑒 ∧ ∀𝑓 ∈ 𝐴 (¬ 𝑓 <s 𝑒 → (𝑒 ↾ suc 𝑐) = (𝑓 ↾ suc 𝑐)) ∧ (𝑒‘𝑐) = 𝑎))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 {cab 2742 ∀wral 3078 ∃wrex 3088 ∪ cun 3904 ifcif 4482 {csn 4584 ⟨cop 4590 class class class wbr 5102 ↦ cmpt 5183 dom cdm 5649 ↾ cres 5651 suc csuc 6350 ℩cio 6477 ‘cfv 6523 ℩crio 7354 2_oc2o 8433 <s clts 27707

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-xp 5655 df-dm 5659 df-res 5661 df-suc 6354 df-iota 6479 df-fv 6531 df-riota 7355

This theorem is referenced by: noeta 27809

W3C validator