Theorem eqcuts2 28172

Description: Condition for equality to a surreal cut. (Contributed by Scott Fenton, 8-Aug-2024.)

Assertion

Ref	Expression
eqcuts2	⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))))

Distinct variable groups:   𝑦,𝐿   𝑦,𝑅   𝑦,𝑋

Proof of Theorem eqcuts2

Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqcuts 28171	. 2 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ (bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}))))
2		eqss 3946	. . . . 5 ⊢ ((bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ((bday‘𝑋) ⊆ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ∧ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ (bday‘𝑋)))
3		sneq 4594	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋})
4	3	breq2d 5115	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑋 → (𝐿 <<s {𝑥} ↔ 𝐿 <<s {𝑋}))
5	3	breq1d 5113	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑋 → ({𝑥} <<s 𝑅 ↔ {𝑋} <<s 𝑅))
6	4, 5	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)))
7	6	elrab3 3646	. . . . . . . . . 10 ⊢ (𝑋 ∈ No → (𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)))
8	7	adantl 487	. . . . . . . . 9 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) → (𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)))
9	8	biimpar 483	. . . . . . . 8 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → 𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})
10		bdayfn 28134	. . . . . . . . 9 ⊢ bday Fn No
11		ssrab2 4028	. . . . . . . . 9 ⊢ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ⊆ No
12		fnfvima 7239	. . . . . . . . 9 ⊢ ((bday Fn No ∧ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ⊆ No ∧ 𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → (bday‘𝑋) ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}))
13	10, 11, 12	mp3an12 1480	. . . . . . . 8 ⊢ (𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} → (bday‘𝑋) ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}))
14		intss1 4923	. . . . . . . 8 ⊢ ((bday‘𝑋) ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ (bday‘𝑋))
15	9, 13, 14	3syl 19	. . . . . . 7 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ (bday‘𝑋))
16	15	biantrud 541	. . . . . 6 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → ((bday‘𝑋) ⊆ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ((bday‘𝑋) ⊆ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ∧ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ (bday‘𝑋))))
17		ssint 4924	. . . . . . 7 ⊢ ((bday‘𝑋) ⊆ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∀𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})(bday‘𝑋) ⊆ 𝑧)
18		fvelimab 6957	. . . . . . . . . . . . . 14 ⊢ ((bday Fn No ∧ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ⊆ No) → (𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∃𝑦 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} (bday‘𝑦) = 𝑧))
19	10, 11, 18	mp2an 705	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∃𝑦 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} (bday‘𝑦) = 𝑧)
20		sneq 4594	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
21	20	breq2d 5115	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → (𝐿 <<s {𝑥} ↔ 𝐿 <<s {𝑦}))
22	20	breq1d 5113	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → ({𝑥} <<s 𝑅 ↔ {𝑦} <<s 𝑅))
23	21, 22	anbi12d 644	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ↔ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)))
24	23	rexrab 3654	. . . . . . . . . . . . 13 ⊢ (∃𝑦 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} (bday‘𝑦) = 𝑧 ↔ ∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧))
25	19, 24	bitri 278	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧))
26	25	imbi1i 352	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → (bday‘𝑋) ⊆ 𝑧) ↔ (∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) → (bday‘𝑋) ⊆ 𝑧))
27		r19.23v 3190	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ No (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) → (bday‘𝑋) ⊆ 𝑧) ↔ (∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) → (bday‘𝑋) ⊆ 𝑧))
28		eqcom 2768	. . . . . . . . . . . . . . 15 ⊢ ((bday‘𝑦) = 𝑧 ↔ 𝑧 = (bday‘𝑦))
29	28	anbi1ci 638	. . . . . . . . . . . . . 14 ⊢ (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) ↔ (𝑧 = (bday‘𝑦) ∧ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)))
30	29	imbi1i 352	. . . . . . . . . . . . 13 ⊢ ((((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) → (bday‘𝑋) ⊆ 𝑧) ↔ ((𝑧 = (bday‘𝑦) ∧ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)) → (bday‘𝑋) ⊆ 𝑧))
31		impexp 456	. . . . . . . . . . . . 13 ⊢ (((𝑧 = (bday‘𝑦) ∧ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)) → (bday‘𝑋) ⊆ 𝑧) ↔ (𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
32	30, 31	bitri 278	. . . . . . . . . . . 12 ⊢ ((((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) → (bday‘𝑋) ⊆ 𝑧) ↔ (𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
33	32	ralbii 3109	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ No (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ (bday‘𝑦) = 𝑧) → (bday‘𝑋) ⊆ 𝑧) ↔ ∀𝑦 ∈ No (𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
34	26, 27, 33	3bitr2i 302	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → (bday‘𝑋) ⊆ 𝑧) ↔ ∀𝑦 ∈ No (𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
35	34	albii 1852	. . . . . . . . 9 ⊢ (∀𝑧(𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → (bday‘𝑋) ⊆ 𝑧) ↔ ∀𝑧∀𝑦 ∈ No (𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
36		df-ral 3078	. . . . . . . . 9 ⊢ (∀𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})(bday‘𝑋) ⊆ 𝑧 ↔ ∀𝑧(𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → (bday‘𝑋) ⊆ 𝑧))
37		ralcom4 3289	. . . . . . . . 9 ⊢ (∀𝑦 ∈ No ∀𝑧(𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)) ↔ ∀𝑧∀𝑦 ∈ No (𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
38	35, 36, 37	3bitr4i 306	. . . . . . . 8 ⊢ (∀𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})(bday‘𝑋) ⊆ 𝑧 ↔ ∀𝑦 ∈ No ∀𝑧(𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)))
39		fvex 6898	. . . . . . . . . 10 ⊢ (bday‘𝑦) ∈ V
40		sseq2 3957	. . . . . . . . . . 11 ⊢ (𝑧 = (bday‘𝑦) → ((bday‘𝑋) ⊆ 𝑧 ↔ (bday‘𝑋) ⊆ (bday‘𝑦)))
41	40	imbi2d 343	. . . . . . . . . 10 ⊢ (𝑧 = (bday‘𝑦) → (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧) ↔ ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦))))
42	39, 41	ceqsalv 3490	. . . . . . . . 9 ⊢ (∀𝑧(𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)) ↔ ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))
43	42	ralbii 3109	. . . . . . . 8 ⊢ (∀𝑦 ∈ No ∀𝑧(𝑧 = (bday‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ 𝑧)) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))
44	38, 43	bitri 278	. . . . . . 7 ⊢ (∀𝑧 ∈ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})(bday‘𝑋) ⊆ 𝑧 ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))
45	17, 44	bitri 278	. . . . . 6 ⊢ ((bday‘𝑋) ⊆ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))
46	16, 45	bitr3di 289	. . . . 5 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → (((bday‘𝑋) ⊆ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ∧ ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ (bday‘𝑋)) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦))))
47	2, 46	bitrid 286	. . . 4 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → ((bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦))))
48	47	pm5.32da 590	. . 3 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) → (((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ (bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})) ↔ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))))
49		df-3an 1105	. . 3 ⊢ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ (bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})) ↔ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ (bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})))
50		df-3an 1105	. . 3 ⊢ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦))) ↔ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦))))
51	48, 49, 50	3bitr4g 317	. 2 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) → ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ (bday‘𝑋) = ∩ (bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})) ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))))
52	1, 51	bitrd 282	1 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → (bday‘𝑋) ⊆ (bday‘𝑦)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  {crab 3413   ⊆ wss 3899  {csn 4584  ∩ cint 4907   class class class wbr 5103   “ cima 5654   Fn wfn 6533  ‘cfv 6538  (class class class)co 7420  Nocsur 27997  bdaycbday 27999   <<s cslts 28143   |s ccuts 28145

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-int 4908  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-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1o 8476  df-2o 8477  df-no 28000  df-lts 28001  df-bday 28002  df-slts 28144  df-cuts 28146

This theorem is used by:  bday0b  28199  cuteq1  28203  oncutlt  28650