Theorem zcuts 28629

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 28620	. 2 ⊢ (𝐴 ∈ ℤs ↔ (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)))
2		n0cut 28556	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({(𝐴 -s 1s )} |s ∅))
3		n0no 28545	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ No )
4		1no 28032	. . . . . . . . 9 ⊢ 1s ∈ No
5	4	a1i 11	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 1s ∈ No )
6	3, 5	subscld 28285	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → (𝐴 -s 1s ) ∈ No )
7		snelpwi 5427	. . . . . . 7 ⊢ ((𝐴 -s 1s ) ∈ No → {(𝐴 -s 1s )} ∈ 𝒫 No )
8		nulsgts 27998	. . . . . . 7 ⊢ ({(𝐴 -s 1s )} ∈ 𝒫 No → {(𝐴 -s 1s )} <<s ∅)
9	6, 7, 8	3syl 19	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → {(𝐴 -s 1s )} <<s ∅)
10		lesid 27960	. . . . . . . 8 ⊢ ((𝐴 -s 1s ) ∈ No → (𝐴 -s 1s ) ≤s (𝐴 -s 1s ))
11	6, 10	syl 18	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → (𝐴 -s 1s ) ≤s (𝐴 -s 1s ))
12		ovex 7449	. . . . . . . . 9 ⊢ (𝐴 -s 1s ) ∈ V
13		breq1 5114	. . . . . . . . . 10 ⊢ (𝑥 = (𝐴 -s 1s ) → (𝑥 ≤s 𝑦 ↔ (𝐴 -s 1s ) ≤s 𝑦))
14	13	rexbidv 3191	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 -s 1s ) → (∃𝑦 ∈ {(𝐴 -s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(𝐴 -s 1s )} (𝐴 -s 1s ) ≤s 𝑦))
15	12, 14	ralsn 4649	. . . . . . . 8 ⊢ (∀𝑥 ∈ {(𝐴 -s 1s )}∃𝑦 ∈ {(𝐴 -s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(𝐴 -s 1s )} (𝐴 -s 1s ) ≤s 𝑦)
16		breq2 5115	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 -s 1s ) → ((𝐴 -s 1s ) ≤s 𝑦 ↔ (𝐴 -s 1s ) ≤s (𝐴 -s 1s )))
17	12, 16	rexsn 4650	. . . . . . . 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 4461	. . . . . . 7 ⊢ ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(𝐴 +s 1s )}𝑦 ≤s 𝑥
21	20	a1i 11	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(𝐴 +s 1s )}𝑦 ≤s 𝑥)
22	3	ltsm1d 28324	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → (𝐴 -s 1s ) <s 𝐴)
23	6, 3, 22	sltssn 27992	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → {(𝐴 -s 1s )} <<s {𝐴})
24	2	sneqd 4603	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → {𝐴} = {({(𝐴 -s 1s )} |s ∅)})
25	23, 24	breqtrd 5139	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → {(𝐴 -s 1s )} <<s {({(𝐴 -s 1s )} |s ∅)})
26	3, 5	addscld 28202	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → (𝐴 +s 1s ) ∈ No )
27	3	ltsp1d 28237	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 𝐴 <s (𝐴 +s 1s ))
28	3, 26, 27	sltssn 27992	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → {𝐴} <<s {(𝐴 +s 1s )})
29	24, 28	eqbrtrrd 5137	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → {({(𝐴 -s 1s )} |s ∅)} <<s {(𝐴 +s 1s )})
30	9, 19, 21, 25, 29	cofcut1d 28143	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → ({(𝐴 -s 1s )} |s ∅) = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}))
31	2, 30	eqtrd 2800	. . . 4 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}))
32	31	adantl 487	. . 3 ⊢ ((𝐴 ∈ No ∧ 𝐴 ∈ ℕ0s) → 𝐴 = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}))
33		negsfn 28245	. . . . . . . 8 ⊢ -us Fn No
34		simpl 488	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → 𝐴 ∈ No )
35	4	a1i 11	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → 1s ∈ No )
36	34, 35	addscld 28202	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (𝐴 +s 1s ) ∈ No )
37		fnsnfv 6964	. . . . . . . 8 ⊢ (( -us Fn No ∧ (𝐴 +s 1s ) ∈ No ) → {( -us ‘(𝐴 +s 1s ))} = ( -us “ {(𝐴 +s 1s )}))
38	33, 36, 37	sylancr 599	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → {( -us ‘(𝐴 +s 1s ))} = ( -us “ {(𝐴 +s 1s )}))
39		negsdi 28272	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ 1s ∈ No ) → ( -us ‘(𝐴 +s 1s )) = (( -us ‘𝐴) +s ( -us ‘ 1s )))
40	34, 4, 39	sylancl 598	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘(𝐴 +s 1s )) = (( -us ‘𝐴) +s ( -us ‘ 1s )))
41		n0no 28545	. . . . . . . . . . 11 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ( -us ‘𝐴) ∈ No )
42	41	adantl 487	. . . . . . . . . 10 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘𝐴) ∈ No )
43	42, 35	subsvald 28283	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (( -us ‘𝐴) -s 1s ) = (( -us ‘𝐴) +s ( -us ‘ 1s )))
44	40, 43	eqtr4d 2803	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘(𝐴 +s 1s )) = (( -us ‘𝐴) -s 1s ))
45	44	sneqd 4603	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → {( -us ‘(𝐴 +s 1s ))} = {(( -us ‘𝐴) -s 1s )})
46	38, 45	eqtr3d 2802	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us “ {(𝐴 +s 1s )}) = {(( -us ‘𝐴) -s 1s )})
47	34, 35	subscld 28285	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (𝐴 -s 1s ) ∈ No )
48		fnsnfv 6964	. . . . . . . 8 ⊢ (( -us Fn No ∧ (𝐴 -s 1s ) ∈ No ) → {( -us ‘(𝐴 -s 1s ))} = ( -us “ {(𝐴 -s 1s )}))
49	33, 47, 48	sylancr 599	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → {( -us ‘(𝐴 -s 1s ))} = ( -us “ {(𝐴 -s 1s )}))
50	35, 34	subsvald 28283	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( 1s -s 𝐴) = ( 1s +s ( -us ‘𝐴)))
51	34, 35	negsubsdi2d 28302	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘(𝐴 -s 1s )) = ( 1s -s 𝐴))
52	42, 35	addscomd 28189	. . . . . . . . 9 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (( -us ‘𝐴) +s 1s ) = ( 1s +s ( -us ‘𝐴)))
53	50, 51, 52	3eqtr4d 2810	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘(𝐴 -s 1s )) = (( -us ‘𝐴) +s 1s ))
54	53	sneqd 4603	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → {( -us ‘(𝐴 -s 1s ))} = {(( -us ‘𝐴) +s 1s )})
55	49, 54	eqtr3d 2802	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us “ {(𝐴 -s 1s )}) = {(( -us ‘𝐴) +s 1s )})
56	46, 55	oveq12d 7434	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (( -us “ {(𝐴 +s 1s )}) |s ( -us “ {(𝐴 -s 1s )})) = ({(( -us ‘𝐴) -s 1s )} |s {(( -us ‘𝐴) +s 1s )}))
57	34	ltsm1d 28324	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (𝐴 -s 1s ) <s 𝐴)
58	34	ltsp1d 28237	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → 𝐴 <s (𝐴 +s 1s ))
59	47, 34, 36, 57, 58	ltstrd 27956	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (𝐴 -s 1s ) <s (𝐴 +s 1s ))
60	47, 36, 59	sltssn 27992	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → {(𝐴 -s 1s )} <<s {(𝐴 +s 1s )})
61		eqidd 2766	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}) = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}))
62	60, 61	negsunif 28277	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘({(𝐴 -s 1s )} |s {(𝐴 +s 1s )})) = (( -us “ {(𝐴 +s 1s )}) |s ( -us “ {(𝐴 -s 1s )})))
63		n0cut 28556	. . . . . . 7 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ( -us ‘𝐴) = ({(( -us ‘𝐴) -s 1s )} |s ∅))
64	4	a1i 11	. . . . . . . . . 10 ⊢ (( -us ‘𝐴) ∈ ℕ0s → 1s ∈ No )
65	41, 64	subscld 28285	. . . . . . . . 9 ⊢ (( -us ‘𝐴) ∈ ℕ0s → (( -us ‘𝐴) -s 1s ) ∈ No )
66		snelpwi 5427	. . . . . . . . 9 ⊢ ((( -us ‘𝐴) -s 1s ) ∈ No → {(( -us ‘𝐴) -s 1s )} ∈ 𝒫 No )
67		nulsgts 27998	. . . . . . . . 9 ⊢ ({(( -us ‘𝐴) -s 1s )} ∈ 𝒫 No → {(( -us ‘𝐴) -s 1s )} <<s ∅)
68	65, 66, 67	3syl 19	. . . . . . . 8 ⊢ (( -us ‘𝐴) ∈ ℕ0s → {(( -us ‘𝐴) -s 1s )} <<s ∅)
69		lesid 27960	. . . . . . . . . 10 ⊢ ((( -us ‘𝐴) -s 1s ) ∈ No → (( -us ‘𝐴) -s 1s ) ≤s (( -us ‘𝐴) -s 1s ))
70	65, 69	syl 18	. . . . . . . . 9 ⊢ (( -us ‘𝐴) ∈ ℕ0s → (( -us ‘𝐴) -s 1s ) ≤s (( -us ‘𝐴) -s 1s ))
71		ovex 7449	. . . . . . . . . . 11 ⊢ (( -us ‘𝐴) -s 1s ) ∈ V
72		breq1 5114	. . . . . . . . . . . 12 ⊢ (𝑥 = (( -us ‘𝐴) -s 1s ) → (𝑥 ≤s 𝑦 ↔ (( -us ‘𝐴) -s 1s ) ≤s 𝑦))
73	72	rexbidv 3191	. . . . . . . . . . 11 ⊢ (𝑥 = (( -us ‘𝐴) -s 1s ) → (∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )} (( -us ‘𝐴) -s 1s ) ≤s 𝑦))
74	71, 73	ralsn 4649	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ {(( -us ‘𝐴) -s 1s )}∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )} (( -us ‘𝐴) -s 1s ) ≤s 𝑦)
75		breq2 5115	. . . . . . . . . . 11 ⊢ (𝑦 = (( -us ‘𝐴) -s 1s ) → ((( -us ‘𝐴) -s 1s ) ≤s 𝑦 ↔ (( -us ‘𝐴) -s 1s ) ≤s (( -us ‘𝐴) -s 1s )))
76	71, 75	rexsn 4650	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )} (( -us ‘𝐴) -s 1s ) ≤s 𝑦 ↔ (( -us ‘𝐴) -s 1s ) ≤s (( -us ‘𝐴) -s 1s ))
77	74, 76	bitri 278	. . . . . . . . 9 ⊢ (∀𝑥 ∈ {(( -us ‘𝐴) -s 1s )}∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )}𝑥 ≤s 𝑦 ↔ (( -us ‘𝐴) -s 1s ) ≤s (( -us ‘𝐴) -s 1s ))
78	70, 77	sylibr 237	. . . . . . . 8 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ∀𝑥 ∈ {(( -us ‘𝐴) -s 1s )}∃𝑦 ∈ {(( -us ‘𝐴) -s 1s )}𝑥 ≤s 𝑦)
79		ral0 4461	. . . . . . . . 9 ⊢ ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(( -us ‘𝐴) +s 1s )}𝑦 ≤s 𝑥
80	79	a1i 11	. . . . . . . 8 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ∀𝑥 ∈ ∅ ∃𝑦 ∈ {(( -us ‘𝐴) +s 1s )}𝑦 ≤s 𝑥)
81	41	ltsm1d 28324	. . . . . . . . . 10 ⊢ (( -us ‘𝐴) ∈ ℕ0s → (( -us ‘𝐴) -s 1s ) <s ( -us ‘𝐴))
82	65, 41, 81	sltssn 27992	. . . . . . . . 9 ⊢ (( -us ‘𝐴) ∈ ℕ0s → {(( -us ‘𝐴) -s 1s )} <<s {( -us ‘𝐴)})
83	63	sneqd 4603	. . . . . . . . 9 ⊢ (( -us ‘𝐴) ∈ ℕ0s → {( -us ‘𝐴)} = {({(( -us ‘𝐴) -s 1s )} |s ∅)})
84	82, 83	breqtrd 5139	. . . . . . . 8 ⊢ (( -us ‘𝐴) ∈ ℕ0s → {(( -us ‘𝐴) -s 1s )} <<s {({(( -us ‘𝐴) -s 1s )} |s ∅)})
85	41, 64	addscld 28202	. . . . . . . . . 10 ⊢ (( -us ‘𝐴) ∈ ℕ0s → (( -us ‘𝐴) +s 1s ) ∈ No )
86	41	ltsp1d 28237	. . . . . . . . . 10 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ( -us ‘𝐴) <s (( -us ‘𝐴) +s 1s ))
87	41, 85, 86	sltssn 27992	. . . . . . . . 9 ⊢ (( -us ‘𝐴) ∈ ℕ0s → {( -us ‘𝐴)} <<s {(( -us ‘𝐴) +s 1s )})
88	83, 87	eqbrtrrd 5137	. . . . . . . 8 ⊢ (( -us ‘𝐴) ∈ ℕ0s → {({(( -us ‘𝐴) -s 1s )} |s ∅)} <<s {(( -us ‘𝐴) +s 1s )})
89	68, 78, 80, 84, 88	cofcut1d 28143	. . . . . . 7 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ({(( -us ‘𝐴) -s 1s )} |s ∅) = ({(( -us ‘𝐴) -s 1s )} |s {(( -us ‘𝐴) +s 1s )}))
90	63, 89	eqtrd 2800	. . . . . 6 ⊢ (( -us ‘𝐴) ∈ ℕ0s → ( -us ‘𝐴) = ({(( -us ‘𝐴) -s 1s )} |s {(( -us ‘𝐴) +s 1s )}))
91	90	adantl 487	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘𝐴) = ({(( -us ‘𝐴) -s 1s )} |s {(( -us ‘𝐴) +s 1s )}))
92	56, 62, 91	3eqtr4rd 2811	. . . 4 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( -us ‘𝐴) = ( -us ‘({(𝐴 -s 1s )} |s {(𝐴 +s 1s )})))
93	60	cutscld 28005	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}) ∈ No )
94		negs11 28271	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}) ∈ No ) → (( -us ‘𝐴) = ( -us ‘({(𝐴 -s 1s )} |s {(𝐴 +s 1s )})) ↔ 𝐴 = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )})))
95	93, 94	syldan 603	. . . 4 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (( -us ‘𝐴) = ( -us ‘({(𝐴 -s 1s )} |s {(𝐴 +s 1s )})) ↔ 𝐴 = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )})))
96	92, 95	mpbid 235	. . 3 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → 𝐴 = ({(𝐴 -s 1s )} |s {(𝐴 +s 1s )}))
97	32, 96	jaodan 972	. 2 ⊢ ((𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ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 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091  ∅c0 4286  𝒫 cpw 4564  {csn 4591   class class class wbr 5111   “ cima 5666   Fn wfn 6535  ‘cfv 6540  (class class class)co 7416   No csur 27833   ≤s cles 27937   <<s cslts 27979   |s ccuts 27981   1_s c1s 28028   +_s cadds 28181   -u_s cnegs 28241   -_s csubs 28242  ℕ_0scn0s 28534  ℤ_sczs 28600

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-ot 4600  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-2o 8456  df-nadd 8654  df-no 27836  df-lts 27837  df-bday 27838  df-les 27938  df-slts 27980  df-cuts 27982  df-0s 28029  df-1s 28030  df-made 28049  df-old 28050  df-left 28052  df-right 28053  df-norec 28160  df-norec2 28171  df-adds 28182  df-negs 28243  df-subs 28244  df-n0s 28536  df-nns 28537  df-zs 28601

This theorem is used by:  pw2cutp1  28683  pw2cut2  28684