Theorem eqscut2 27866

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

Assertion

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

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

Proof of Theorem eqscut2

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

Step	Hyp	Ref	Expression
1		eqscut 27865	. 2 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}))))
2		eqss 4011	. . . . 5 ⊢ (( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ (( bday ‘𝑋) ⊆ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ∧ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ ( bday ‘𝑋)))
3		sneq 4641	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋})
4	3	breq2d 5160	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑋 → (𝐿 <<s {𝑥} ↔ 𝐿 <<s {𝑋}))
5	3	breq1d 5158	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑋 → ({𝑥} <<s 𝑅 ↔ {𝑋} <<s 𝑅))
6	4, 5	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)))
7	6	elrab3 3696	. . . . . . . . . 10 ⊢ (𝑋 ∈ No → (𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)))
8	7	adantl 481	. . . . . . . . 9 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) → (𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)))
9	8	biimpar 477	. . . . . . . 8 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → 𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})
10		bdayfn 27833	. . . . . . . . 9 ⊢ bday Fn No
11		ssrab2 4090	. . . . . . . . 9 ⊢ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ⊆ No
12		fnfvima 7253	. . . . . . . . 9 ⊢ (( bday Fn No ∧ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ⊆ No ∧ 𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ( bday ‘𝑋) ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}))
13	10, 11, 12	mp3an12 1450	. . . . . . . 8 ⊢ (𝑋 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} → ( bday ‘𝑋) ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}))
14		intss1 4968	. . . . . . . 8 ⊢ (( bday ‘𝑋) ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ ( bday ‘𝑋))
15	9, 13, 14	3syl 18	. . . . . . 7 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ ( bday ‘𝑋))
16	15	biantrud 531	. . . . . 6 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → (( bday ‘𝑋) ⊆ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ (( bday ‘𝑋) ⊆ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ∧ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ ( bday ‘𝑋))))
17		ssint 4969	. . . . . . 7 ⊢ (( bday ‘𝑋) ⊆ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∀𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})( bday ‘𝑋) ⊆ 𝑧)
18		fvelimab 6981	. . . . . . . . . . . . . 14 ⊢ (( bday Fn No ∧ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ⊆ No ) → (𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∃𝑦 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ( bday ‘𝑦) = 𝑧))
19	10, 11, 18	mp2an 692	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∃𝑦 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ( bday ‘𝑦) = 𝑧)
20		sneq 4641	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦})
21	20	breq2d 5160	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → (𝐿 <<s {𝑥} ↔ 𝐿 <<s {𝑦}))
22	20	breq1d 5158	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑦 → ({𝑥} <<s 𝑅 ↔ {𝑦} <<s 𝑅))
23	21, 22	anbi12d 632	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ↔ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)))
24	23	rexrab 3705	. . . . . . . . . . . . 13 ⊢ (∃𝑦 ∈ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)} ( bday ‘𝑦) = 𝑧 ↔ ∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧))
25	19, 24	bitri 275	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧))
26	25	imbi1i 349	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ( bday ‘𝑋) ⊆ 𝑧) ↔ (∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) → ( bday ‘𝑋) ⊆ 𝑧))
27		r19.23v 3181	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ No (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) → ( bday ‘𝑋) ⊆ 𝑧) ↔ (∃𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) → ( bday ‘𝑋) ⊆ 𝑧))
28		eqcom 2742	. . . . . . . . . . . . . . 15 ⊢ (( bday ‘𝑦) = 𝑧 ↔ 𝑧 = ( bday ‘𝑦))
29	28	anbi1ci 626	. . . . . . . . . . . . . 14 ⊢ (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) ↔ (𝑧 = ( bday ‘𝑦) ∧ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)))
30	29	imbi1i 349	. . . . . . . . . . . . 13 ⊢ ((((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) → ( bday ‘𝑋) ⊆ 𝑧) ↔ ((𝑧 = ( bday ‘𝑦) ∧ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)) → ( bday ‘𝑋) ⊆ 𝑧))
31		impexp 450	. . . . . . . . . . . . 13 ⊢ (((𝑧 = ( bday ‘𝑦) ∧ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)) → ( bday ‘𝑋) ⊆ 𝑧) ↔ (𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
32	30, 31	bitri 275	. . . . . . . . . . . 12 ⊢ ((((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) → ( bday ‘𝑋) ⊆ 𝑧) ↔ (𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
33	32	ralbii 3091	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ No (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) ∧ ( bday ‘𝑦) = 𝑧) → ( bday ‘𝑋) ⊆ 𝑧) ↔ ∀𝑦 ∈ No (𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
34	26, 27, 33	3bitr2i 299	. . . . . . . . . 10 ⊢ ((𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ( bday ‘𝑋) ⊆ 𝑧) ↔ ∀𝑦 ∈ No (𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
35	34	albii 1816	. . . . . . . . 9 ⊢ (∀𝑧(𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ( bday ‘𝑋) ⊆ 𝑧) ↔ ∀𝑧∀𝑦 ∈ No (𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
36		df-ral 3060	. . . . . . . . 9 ⊢ (∀𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})( bday ‘𝑋) ⊆ 𝑧 ↔ ∀𝑧(𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) → ( bday ‘𝑋) ⊆ 𝑧))
37		ralcom4 3284	. . . . . . . . 9 ⊢ (∀𝑦 ∈ No ∀𝑧(𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)) ↔ ∀𝑧∀𝑦 ∈ No (𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
38	35, 36, 37	3bitr4i 303	. . . . . . . 8 ⊢ (∀𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})( bday ‘𝑋) ⊆ 𝑧 ↔ ∀𝑦 ∈ No ∀𝑧(𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)))
39		fvex 6920	. . . . . . . . . 10 ⊢ ( bday ‘𝑦) ∈ V
40		sseq2 4022	. . . . . . . . . . 11 ⊢ (𝑧 = ( bday ‘𝑦) → (( bday ‘𝑋) ⊆ 𝑧 ↔ ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))
41	40	imbi2d 340	. . . . . . . . . 10 ⊢ (𝑧 = ( bday ‘𝑦) → (((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧) ↔ ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦))))
42	39, 41	ceqsalv 3519	. . . . . . . . 9 ⊢ (∀𝑧(𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)) ↔ ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))
43	42	ralbii 3091	. . . . . . . 8 ⊢ (∀𝑦 ∈ No ∀𝑧(𝑧 = ( bday ‘𝑦) → ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ 𝑧)) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))
44	38, 43	bitri 275	. . . . . . 7 ⊢ (∀𝑧 ∈ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})( bday ‘𝑋) ⊆ 𝑧 ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))
45	17, 44	bitri 275	. . . . . 6 ⊢ (( bday ‘𝑋) ⊆ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))
46	16, 45	bitr3di 286	. . . . 5 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → ((( bday ‘𝑋) ⊆ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ∧ ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ⊆ ( bday ‘𝑋)) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦))))
47	2, 46	bitrid 283	. . . 4 ⊢ (((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) ∧ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅)) → (( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)}) ↔ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦))))
48	47	pm5.32da 579	. . 3 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) → (((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ ( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})) ↔ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))))
49		df-3an 1088	. . 3 ⊢ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})) ↔ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ ( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})))
50		df-3an 1088	. . 3 ⊢ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦))) ↔ ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅) ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦))))
51	48, 49, 50	3bitr4g 314	. 2 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) → ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday ‘𝑋) = ∩ ( bday “ {𝑥 ∈ No ∣ (𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅)})) ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))))
52	1, 51	bitrd 279	1 ⊢ ((𝐿 <<s 𝑅 ∧ 𝑋 ∈ No ) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ∀𝑦 ∈ No ((𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅) → ( bday ‘𝑋) ⊆ ( bday ‘𝑦)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1535   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068  {crab 3433   ⊆ wss 3963  {csn 4631  ∩ cint 4951   class class class wbr 5148   “ cima 5692   Fn wfn 6558  ‘cfv 6563  (class class class)co 7431   No csur 27699   bday cbday 27701   <<s csslt 27840   |s cscut 27842

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1o 8505  df-2o 8506  df-no 27702  df-slt 27703  df-bday 27704  df-sslt 27841  df-scut 27843

This theorem is referenced by:  bday0b  27890  cuteq1  27893