Theorem zcuts 28799

Description: A cut expression for surreal integers. (Contributed by Scott Fenton, 20-Aug-2025.)

Assertion

Ref	Expression
zcuts	⊢ (𝐴 ∈ ℤs → 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))

Proof of Theorem zcuts

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

Step	Hyp	Ref	Expression
1		elzn0s 28790	. 2 ⊢ (𝐴 ∈ ℤs ↔ (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -s‘𝐴) ∈ ℕ0s)))
2		n0cut 28726	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({(𝐴 −s 1s )} |s ∅))
3		n0no 28715	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ No)
4		1no 28202	. . . . . . . . 9 ⊢ 1s ∈ No
5	4	a1i 11	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 1s ∈ No)
6	3, 5	subscld 28455	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → (𝐴 −s 1s ) ∈ No)
7		snelpwi 5411	. . . . . . 7 ⊢ ((𝐴 −s 1s ) ∈ No → {(𝐴 −s 1s )} ∈ 𝒫 No)
8		nulsgts 28168	. . . . . . 7 ⊢ ({(𝐴 −s 1s )} ∈ 𝒫 No → {(𝐴 −s 1s )} <<s ∅)
9	6, 7, 8	3syl 19	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → {(𝐴 −s 1s )} <<s ∅)
10		lesid 28130	. . . . . . . 8 ⊢ ((𝐴 −s 1s ) ∈ No → (𝐴 −s 1s ) ≤s (𝐴 −s 1s ))
11	6, 10	syl 18	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → (𝐴 −s 1s ) ≤s (𝐴 −s 1s ))
12		ovex 7454	. . . . . . . . 9 ⊢ (𝐴 −s 1s ) ∈ V
13		breq1 5105	. . . . . . . . . 10 ⊢ (𝑥 = (𝐴 −s 1s ) → (𝑥 ≤s 𝑦 ↔ (𝐴 −s 1s ) ≤s 𝑦))
14	13	rexbidv 3186	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 −s 1s ) → (∃𝑦 ∈ {(𝐴 −s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(𝐴 −s 1s )} (𝐴 −s 1s ) ≤s 𝑦))
15	12, 14	ralsn 4638	. . . . . . . 8 ⊢ (∀𝑥 ∈ {(𝐴 −s 1s )}∃𝑦 ∈ {(𝐴 −s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(𝐴 −s 1s )} (𝐴 −s 1s ) ≤s 𝑦)
16		breq2 5106	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 −s 1s ) → ((𝐴 −s 1s ) ≤s 𝑦 ↔ (𝐴 −s 1s ) ≤s (𝐴 −s 1s )))
17	12, 16	rexsn 4639	. . . . . . . 8 ⊢ (∃𝑦 ∈ {(𝐴 −s 1s )} (𝐴 −s 1s ) ≤s 𝑦 ↔ (𝐴 −s 1s ) ≤s (𝐴 −s 1s ))
18	15, 17	bitri 278	. . . . . . 7 ⊢ (∀𝑥 ∈ {(𝐴 −s 1s )}∃𝑦 ∈ {(𝐴 −s 1s )}𝑥 ≤s 𝑦 ↔ (𝐴 −s 1s ) ≤s (𝐴 −s 1s ))
19	11, 18	sylibr 237	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → ∀𝑥 ∈ {(𝐴 −s 1s )}∃𝑦 ∈ {(𝐴 −s 1s )}𝑥 ≤s 𝑦)
20		ral0 4453	. . . . . . 7 ⊢ ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(𝐴 +s 1s )}𝑦 ≤s 𝑥
21	20	a1i 11	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(𝐴 +s 1s )}𝑦 ≤s 𝑥)
22	3	ltsm1d 28494	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → (𝐴 −s 1s ) <s 𝐴)
23	6, 3, 22	sltssn 28162	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → {(𝐴 −s 1s )} <<s {𝐴})
24	2	sneqd 4592	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → {𝐴} = {({(𝐴 −s 1s )} |s ∅)})
25	23, 24	breqtrd 5130	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → {(𝐴 −s 1s )} <<s {({(𝐴 −s 1s )} |s ∅)})
26	3, 5	addscld 28372	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → (𝐴 +s 1s ) ∈ No)
27	3	ltsp1d 28407	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 𝐴 <s (𝐴 +s 1s ))
28	3, 26, 27	sltssn 28162	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → {𝐴} <<s {(𝐴 +s 1s )})
29	24, 28	eqbrtrrd 5128	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → {({(𝐴 −s 1s )} |s ∅)} <<s {(𝐴 +s 1s )})
30	9, 19, 21, 25, 29	cofcut1d 28313	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → ({(𝐴 −s 1s )} |s ∅) = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))
31	2, 30	eqtrd 2795	. . . 4 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))
32	31	adantl 487	. . 3 ⊢ ((𝐴 ∈ No ∧ 𝐴 ∈ ℕ0s) → 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))
33		negsfn 28415	. . . . . . . 8 ⊢ -s Fn No
34		simpl 488	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → 𝐴 ∈ No)
35	4	a1i 11	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → 1s ∈ No)
36	34, 35	addscld 28372	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (𝐴 +s 1s ) ∈ No)
37		fnsnfv 6965	. . . . . . . 8 ⊢ (( -s Fn No ∧ (𝐴 +s 1s ) ∈ No) → {( -s‘(𝐴 +s 1s ))} = ( -s “ {(𝐴 +s 1s )}))
38	33, 36, 37	sylancr 599	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → {( -s‘(𝐴 +s 1s ))} = ( -s “ {(𝐴 +s 1s )}))
39		negsdi 28442	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 1s ∈ No) → ( -s‘(𝐴 +s 1s )) = (( -s‘𝐴) +s ( -s‘ 1s )))
40	34, 4, 39	sylancl 598	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘(𝐴 +s 1s )) = (( -s‘𝐴) +s ( -s‘ 1s )))
41		n0no 28715	. . . . . . . . . . 11 ⊢ (( -s‘𝐴) ∈ ℕ0s → ( -s‘𝐴) ∈ No)
42	41	adantl 487	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘𝐴) ∈ No)
43	42, 35	subsvald 28453	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (( -s‘𝐴) −s 1s ) = (( -s‘𝐴) +s ( -s‘ 1s )))
44	40, 43	eqtr4d 2798	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘(𝐴 +s 1s )) = (( -s‘𝐴) −s 1s ))
45	44	sneqd 4592	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → {( -s‘(𝐴 +s 1s ))} = {(( -s‘𝐴) −s 1s )})
46	38, 45	eqtr3d 2797	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s “ {(𝐴 +s 1s )}) = {(( -s‘𝐴) −s 1s )})
47	34, 35	subscld 28455	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (𝐴 −s 1s ) ∈ No)
48		fnsnfv 6965	. . . . . . . 8 ⊢ (( -s Fn No ∧ (𝐴 −s 1s ) ∈ No) → {( -s‘(𝐴 −s 1s ))} = ( -s “ {(𝐴 −s 1s )}))
49	33, 47, 48	sylancr 599	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → {( -s‘(𝐴 −s 1s ))} = ( -s “ {(𝐴 −s 1s )}))
50	35, 34	subsvald 28453	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( 1s −s 𝐴) = ( 1s +s ( -s‘𝐴)))
51	34, 35	negsubsdi2d 28472	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘(𝐴 −s 1s )) = ( 1s −s 𝐴))
52	42, 35	addscomd 28359	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (( -s‘𝐴) +s 1s ) = ( 1s +s ( -s‘𝐴)))
53	50, 51, 52	3eqtr4d 2805	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘(𝐴 −s 1s )) = (( -s‘𝐴) +s 1s ))
54	53	sneqd 4592	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → {( -s‘(𝐴 −s 1s ))} = {(( -s‘𝐴) +s 1s )})
55	49, 54	eqtr3d 2797	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s “ {(𝐴 −s 1s )}) = {(( -s‘𝐴) +s 1s )})
56	46, 55	oveq12d 7439	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (( -s “ {(𝐴 +s 1s )}) |s ( -s “ {(𝐴 −s 1s )})) = ({(( -s‘𝐴) −s 1s )} |s {(( -s‘𝐴) +s 1s )}))
57	34	ltsm1d 28494	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (𝐴 −s 1s ) <s 𝐴)
58	34	ltsp1d 28407	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → 𝐴 <s (𝐴 +s 1s ))
59	47, 34, 36, 57, 58	ltstrd 28126	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (𝐴 −s 1s ) <s (𝐴 +s 1s ))
60	47, 36, 59	sltssn 28162	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → {(𝐴 −s 1s )} <<s {(𝐴 +s 1s )})
61		eqidd 2761	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}) = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))
62	60, 61	negsunif 28447	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘({(𝐴 −s 1s )} |s {(𝐴 +s 1s )})) = (( -s “ {(𝐴 +s 1s )}) |s ( -s “ {(𝐴 −s 1s )})))
63		n0cut 28726	. . . . . . 7 ⊢ (( -s‘𝐴) ∈ ℕ0s → ( -s‘𝐴) = ({(( -s‘𝐴) −s 1s )} |s ∅))
64	4	a1i 11	. . . . . . . . . 10 ⊢ (( -s‘𝐴) ∈ ℕ0s → 1s ∈ No)
65	41, 64	subscld 28455	. . . . . . . . 9 ⊢ (( -s‘𝐴) ∈ ℕ0s → (( -s‘𝐴) −s 1s ) ∈ No)
66		snelpwi 5411	. . . . . . . . 9 ⊢ ((( -s‘𝐴) −s 1s ) ∈ No → {(( -s‘𝐴) −s 1s )} ∈ 𝒫 No)
67		nulsgts 28168	. . . . . . . . 9 ⊢ ({(( -s‘𝐴) −s 1s )} ∈ 𝒫 No → {(( -s‘𝐴) −s 1s )} <<s ∅)
68	65, 66, 67	3syl 19	. . . . . . . 8 ⊢ (( -s‘𝐴) ∈ ℕ0s → {(( -s‘𝐴) −s 1s )} <<s ∅)
69		lesid 28130	. . . . . . . . . 10 ⊢ ((( -s‘𝐴) −s 1s ) ∈ No → (( -s‘𝐴) −s 1s ) ≤s (( -s‘𝐴) −s 1s ))
70	65, 69	syl 18	. . . . . . . . 9 ⊢ (( -s‘𝐴) ∈ ℕ0s → (( -s‘𝐴) −s 1s ) ≤s (( -s‘𝐴) −s 1s ))
71		ovex 7454	. . . . . . . . . . 11 ⊢ (( -s‘𝐴) −s 1s ) ∈ V
72		breq1 5105	. . . . . . . . . . . 12 ⊢ (𝑥 = (( -s‘𝐴) −s 1s ) → (𝑥 ≤s 𝑦 ↔ (( -s‘𝐴) −s 1s ) ≤s 𝑦))
73	72	rexbidv 3186	. . . . . . . . . . 11 ⊢ (𝑥 = (( -s‘𝐴) −s 1s ) → (∃𝑦 ∈ {(( -s‘𝐴) −s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(( -s‘𝐴) −s 1s )} (( -s‘𝐴) −s 1s ) ≤s 𝑦))
74	71, 73	ralsn 4638	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ {(( -s‘𝐴) −s 1s )}∃𝑦 ∈ {(( -s‘𝐴) −s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(( -s‘𝐴) −s 1s )} (( -s‘𝐴) −s 1s ) ≤s 𝑦)
75		breq2 5106	. . . . . . . . . . 11 ⊢ (𝑦 = (( -s‘𝐴) −s 1s ) → ((( -s‘𝐴) −s 1s ) ≤s 𝑦 ↔ (( -s‘𝐴) −s 1s ) ≤s (( -s‘𝐴) −s 1s )))
76	71, 75	rexsn 4639	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ {(( -s‘𝐴) −s 1s )} (( -s‘𝐴) −s 1s ) ≤s 𝑦 ↔ (( -s‘𝐴) −s 1s ) ≤s (( -s‘𝐴) −s 1s ))
77	74, 76	bitri 278	. . . . . . . . 9 ⊢ (∀𝑥 ∈ {(( -s‘𝐴) −s 1s )}∃𝑦 ∈ {(( -s‘𝐴) −s 1s )}𝑥 ≤s 𝑦 ↔ (( -s‘𝐴) −s 1s ) ≤s (( -s‘𝐴) −s 1s ))
78	70, 77	sylibr 237	. . . . . . . 8 ⊢ (( -s‘𝐴) ∈ ℕ0s → ∀𝑥 ∈ {(( -s‘𝐴) −s 1s )}∃𝑦 ∈ {(( -s‘𝐴) −s 1s )}𝑥 ≤s 𝑦)
79		ral0 4453	. . . . . . . . 9 ⊢ ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(( -s‘𝐴) +s 1s )}𝑦 ≤s 𝑥
80	79	a1i 11	. . . . . . . 8 ⊢ (( -s‘𝐴) ∈ ℕ0s → ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(( -s‘𝐴) +s 1s )}𝑦 ≤s 𝑥)
81	41	ltsm1d 28494	. . . . . . . . . 10 ⊢ (( -s‘𝐴) ∈ ℕ0s → (( -s‘𝐴) −s 1s ) <s ( -s‘𝐴))
82	65, 41, 81	sltssn 28162	. . . . . . . . 9 ⊢ (( -s‘𝐴) ∈ ℕ0s → {(( -s‘𝐴) −s 1s )} <<s {( -s‘𝐴)})
83	63	sneqd 4592	. . . . . . . . 9 ⊢ (( -s‘𝐴) ∈ ℕ0s → {( -s‘𝐴)} = {({(( -s‘𝐴) −s 1s )} |s ∅)})
84	82, 83	breqtrd 5130	. . . . . . . 8 ⊢ (( -s‘𝐴) ∈ ℕ0s → {(( -s‘𝐴) −s 1s )} <<s {({(( -s‘𝐴) −s 1s )} |s ∅)})
85	41, 64	addscld 28372	. . . . . . . . . 10 ⊢ (( -s‘𝐴) ∈ ℕ0s → (( -s‘𝐴) +s 1s ) ∈ No)
86	41	ltsp1d 28407	. . . . . . . . . 10 ⊢ (( -s‘𝐴) ∈ ℕ0s → ( -s‘𝐴) <s (( -s‘𝐴) +s 1s ))
87	41, 85, 86	sltssn 28162	. . . . . . . . 9 ⊢ (( -s‘𝐴) ∈ ℕ0s → {( -s‘𝐴)} <<s {(( -s‘𝐴) +s 1s )})
88	83, 87	eqbrtrrd 5128	. . . . . . . 8 ⊢ (( -s‘𝐴) ∈ ℕ0s → {({(( -s‘𝐴) −s 1s )} |s ∅)} <<s {(( -s‘𝐴) +s 1s )})
89	68, 78, 80, 84, 88	cofcut1d 28313	. . . . . . 7 ⊢ (( -s‘𝐴) ∈ ℕ0s → ({(( -s‘𝐴) −s 1s )} |s ∅) = ({(( -s‘𝐴) −s 1s )} |s {(( -s‘𝐴) +s 1s )}))
90	63, 89	eqtrd 2795	. . . . . 6 ⊢ (( -s‘𝐴) ∈ ℕ0s → ( -s‘𝐴) = ({(( -s‘𝐴) −s 1s )} |s {(( -s‘𝐴) +s 1s )}))
91	90	adantl 487	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘𝐴) = ({(( -s‘𝐴) −s 1s )} |s {(( -s‘𝐴) +s 1s )}))
92	56, 62, 91	3eqtr4rd 2806	. . . 4 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ( -s‘𝐴) = ( -s‘({(𝐴 −s 1s )} |s {(𝐴 +s 1s )})))
93	60	cutscld 28175	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}) ∈ No)
94		negs11 28441	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}) ∈ No) → (( -s‘𝐴) = ( -s‘({(𝐴 −s 1s )} |s {(𝐴 +s 1s )})) ↔ 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )})))
95	93, 94	syldan 603	. . . 4 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → (( -s‘𝐴) = ( -s‘({(𝐴 −s 1s )} |s {(𝐴 +s 1s )})) ↔ 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )})))
96	92, 95	mpbid 235	. . 3 ⊢ ((𝐴 ∈ No ∧ ( -s‘𝐴) ∈ ℕ0s) → 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))
97	32, 96	jaodan 972	. 2 ⊢ ((𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -s‘𝐴) ∈ ℕ0s)) → 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))
98	1, 97	sylbi 220	1 ⊢ (𝐴 ∈ ℤs → 𝐴 = ({(𝐴 −s 1s )} |s {(𝐴 +s 1s )}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  ∅c0 4278  𝒫 cpw 4556  {csn 4584   class class class wbr 5102   “ cima 5653   Fn wfn 6534  ‘cfv 6539  (class class class)co 7421  Nocsur 28003   ≤s cles 28107   <<s cslts 28149   |s ccuts 28151   1_s c1s 28198   +_s cadds 28351   -_scnegs 28411   −_s csubs 28412  ℕ_0scn0s 28704  ℤ_sczs 28770

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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752

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 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-ot 4858  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-1st 8002  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-1o 8480  df-2o 8481  df-nadd 8679  df-no 28006  df-lts 28007  df-bday 28008  df-les 28108  df-slts 28150  df-cuts 28152  df-0s 28199  df-1s 28200  df-made 28219  df-old 28220  df-left 28222  df-right 28223  df-norec 28330  df-norec2 28341  df-adds 28352  df-negs 28413  df-subs 28414  df-n0s 28706  df-nns 28707  df-zs 28771

This theorem is used by:  pw2cutp1  28853  pw2cut2  28854