eucliddivs - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > eucliddivs		Structured version Visualization version GIF version

Theorem eucliddivs 28476

Description: Euclid's division lemma for surreal numbers. (Contributed by Scott Fenton, 8-Nov-2025.)

**Assertion**
Ref	Expression
eucliddivs	⊢ ((𝐴 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))

Distinct variable groups: 𝐴,𝑝,𝑞 𝐵,𝑝,𝑞

Proof of Theorem eucliddivs Dummy variables 𝑎 𝑚 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2767	. . . . . 6 ⊢ (𝑚 = 0_s → (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ↔ 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞)))
2	1	anbi1d 640	. . . . 5 ⊢ (𝑚 = 0_s → ((𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
3	2	2rexbidv 3228	. . . 4 ⊢ (𝑚 = 0_s → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
4	3	imbi2d 342	. . 3 ⊢ (𝑚 = 0_s → ((𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)) ↔ (𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))))
5		eqeq1 2767	. . . . . 6 ⊢ (𝑚 = 𝑎 → (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ↔ 𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞)))
6	5	anbi1d 640	. . . . 5 ⊢ (𝑚 = 𝑎 → ((𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
7	6	2rexbidv 3228	. . . 4 ⊢ (𝑚 = 𝑎 → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
8	7	imbi2d 342	. . 3 ⊢ (𝑚 = 𝑎 → ((𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)) ↔ (𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))))
9		eqeq1 2767	. . . . . . 7 ⊢ (𝑚 = (𝑎 +_s 1_s ) → (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ↔ (𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑞)))
10	9	anbi1d 640	. . . . . 6 ⊢ (𝑚 = (𝑎 +_s 1_s ) → ((𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
11	10	2rexbidv 3228	. . . . 5 ⊢ (𝑚 = (𝑎 +_s 1_s ) → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
12		oveq2 7404	. . . . . . . . 9 ⊢ (𝑝 = 𝑟 → (𝐵 ·_s 𝑝) = (𝐵 ·_s 𝑟))
13	12	oveq1d 7411	. . . . . . . 8 ⊢ (𝑝 = 𝑟 → ((𝐵 ·_s 𝑝) +_s 𝑞) = ((𝐵 ·_s 𝑟) +_s 𝑞))
14	13	eqeq2d 2774	. . . . . . 7 ⊢ (𝑝 = 𝑟 → ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑞) ↔ (𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑞)))
15	14	anbi1d 640	. . . . . 6 ⊢ (𝑝 = 𝑟 → (((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
16		oveq2 7404	. . . . . . . 8 ⊢ (𝑞 = 𝑠 → ((𝐵 ·_s 𝑟) +_s 𝑞) = ((𝐵 ·_s 𝑟) +_s 𝑠))
17	16	eqeq2d 2774	. . . . . . 7 ⊢ (𝑞 = 𝑠 → ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑞) ↔ (𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠)))
18		breq1 5104	. . . . . . 7 ⊢ (𝑞 = 𝑠 → (𝑞 <s 𝐵 ↔ 𝑠 <s 𝐵))
19	17, 18	anbi12d 641	. . . . . 6 ⊢ (𝑞 = 𝑠 → (((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
20	15, 19	cbvrex2vw 3246	. . . . 5 ⊢ (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))
21	11, 20	bitrdi 289	. . . 4 ⊢ (𝑚 = (𝑎 +_s 1_s ) → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
22	21	imbi2d 342	. . 3 ⊢ (𝑚 = (𝑎 +_s 1_s ) → ((𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)) ↔ (𝐵 ∈ ℕ_s → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))))
23		eqeq1 2767	. . . . . 6 ⊢ (𝑚 = 𝐴 → (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ↔ 𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞)))
24	23	anbi1d 640	. . . . 5 ⊢ (𝑚 = 𝐴 → ((𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ (𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
25	24	2rexbidv 3228	. . . 4 ⊢ (𝑚 = 𝐴 → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
26	25	imbi2d 342	. . 3 ⊢ (𝑚 = 𝐴 → ((𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑚 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)) ↔ (𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))))
27		nnno 28424	. . . . . . 7 ⊢ (𝐵 ∈ ℕ_s → 𝐵 ∈ No )
28		muls01 28212	. . . . . . 7 ⊢ (𝐵 ∈ No → (𝐵 ·_s 0_s ) = 0_s )
29	27, 28	syl 17	. . . . . 6 ⊢ (𝐵 ∈ ℕ_s → (𝐵 ·_s 0_s ) = 0_s )
30	29	oveq1d 7411	. . . . 5 ⊢ (𝐵 ∈ ℕ_s → ((𝐵 ·_s 0_s ) +_s 0_s ) = ( 0_s +_s 0_s ))
31		0no 27909	. . . . . 6 ⊢ 0_s ∈ No
32		addslid 28068	. . . . . 6 ⊢ ( 0_s ∈ No → ( 0_s +_s 0_s ) = 0_s )
33	31, 32	ax-mp 5	. . . . 5 ⊢ ( 0_s +_s 0_s ) = 0_s
34	30, 33	eqtr2di 2815	. . . 4 ⊢ (𝐵 ∈ ℕ_s → 0_s = ((𝐵 ·_s 0_s ) +_s 0_s ))
35		nnsgt0 28439	. . . 4 ⊢ (𝐵 ∈ ℕ_s → 0_s <s 𝐵)
36		0n0s 28429	. . . . 5 ⊢ 0_s ∈ ℕ_0s
37		oveq2 7404	. . . . . . . . 9 ⊢ (𝑝 = 0_s → (𝐵 ·_s 𝑝) = (𝐵 ·_s 0_s ))
38	37	oveq1d 7411	. . . . . . . 8 ⊢ (𝑝 = 0_s → ((𝐵 ·_s 𝑝) +_s 𝑞) = ((𝐵 ·_s 0_s ) +_s 𝑞))
39	38	eqeq2d 2774	. . . . . . 7 ⊢ (𝑝 = 0_s → ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ↔ 0_s = ((𝐵 ·_s 0_s ) +_s 𝑞)))
40	39	anbi1d 640	. . . . . 6 ⊢ (𝑝 = 0_s → (( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ( 0_s = ((𝐵 ·_s 0_s ) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
41		oveq2 7404	. . . . . . . 8 ⊢ (𝑞 = 0_s → ((𝐵 ·_s 0_s ) +_s 𝑞) = ((𝐵 ·_s 0_s ) +_s 0_s ))
42	41	eqeq2d 2774	. . . . . . 7 ⊢ (𝑞 = 0_s → ( 0_s = ((𝐵 ·_s 0_s ) +_s 𝑞) ↔ 0_s = ((𝐵 ·_s 0_s ) +_s 0_s )))
43		breq1 5104	. . . . . . 7 ⊢ (𝑞 = 0_s → (𝑞 <s 𝐵 ↔ 0_s <s 𝐵))
44	42, 43	anbi12d 641	. . . . . 6 ⊢ (𝑞 = 0_s → (( 0_s = ((𝐵 ·_s 0_s ) +_s 𝑞) ∧ 𝑞 <s 𝐵) ↔ ( 0_s = ((𝐵 ·_s 0_s ) +_s 0_s ) ∧ 0_s <s 𝐵)))
45	40, 44	rspc2ev 3595	. . . . 5 ⊢ (( 0_s ∈ ℕ_0s ∧ 0_s ∈ ℕ_0s ∧ ( 0_s = ((𝐵 ·_s 0_s ) +_s 0_s ) ∧ 0_s <s 𝐵)) → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))
46	36, 36, 45	mp3an12 1473	. . . 4 ⊢ (( 0_s = ((𝐵 ·_s 0_s ) +_s 0_s ) ∧ 0_s <s 𝐵) → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))
47	34, 35, 46	syl2anc 593	. . 3 ⊢ (𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s ( 0_s = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))
48		simprr 782	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝑞 ∈ ℕ_0s)
49		simplr 778	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝐵 ∈ ℕ_s)
50		nnm1n0s 28475	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℕ_s → (𝐵 -_s 1_s ) ∈ ℕ_0s)
51	49, 50	syl 17	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 -_s 1_s ) ∈ ℕ_0s)
52		n0lesltp1 28466	. . . . . . . . . . 11 ⊢ ((𝑞 ∈ ℕ_0s ∧ (𝐵 -_s 1_s ) ∈ ℕ_0s) → (𝑞 ≤s (𝐵 -_s 1_s ) ↔ 𝑞 <s ((𝐵 -_s 1_s ) +_s 1_s )))
53	48, 51, 52	syl2anc 593	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 ≤s (𝐵 -_s 1_s ) ↔ 𝑞 <s ((𝐵 -_s 1_s ) +_s 1_s )))
54	48	n0nod 28425	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝑞 ∈ No )
55	51	n0nod 28425	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 -_s 1_s ) ∈ No )
56		lesloe 27825	. . . . . . . . . . 11 ⊢ ((𝑞 ∈ No ∧ (𝐵 -_s 1_s ) ∈ No ) → (𝑞 ≤s (𝐵 -_s 1_s ) ↔ (𝑞 <s (𝐵 -_s 1_s ) ∨ 𝑞 = (𝐵 -_s 1_s ))))
57	54, 55, 56	syl2anc 593	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 ≤s (𝐵 -_s 1_s ) ↔ (𝑞 <s (𝐵 -_s 1_s ) ∨ 𝑞 = (𝐵 -_s 1_s ))))
58	49	nnnod 28426	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝐵 ∈ No )
59		1no 27910	. . . . . . . . . . . 12 ⊢ 1_s ∈ No
60		npcans 28175	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ No ∧ 1_s ∈ No ) → ((𝐵 -_s 1_s ) +_s 1_s ) = 𝐵)
61	58, 59, 60	sylancl 595	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝐵 -_s 1_s ) +_s 1_s ) = 𝐵)
62	61	breq2d 5113	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 <s ((𝐵 -_s 1_s ) +_s 1_s ) ↔ 𝑞 <s 𝐵))
63	53, 57, 62	3bitr3rd 312	. . . . . . . . 9 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 <s 𝐵 ↔ (𝑞 <s (𝐵 -_s 1_s ) ∨ 𝑞 = (𝐵 -_s 1_s ))))
64		simplrl 786	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) ∧ 𝑞 <s (𝐵 -_s 1_s )) → 𝑝 ∈ ℕ_0s)
65		simplrr 787	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) ∧ 𝑞 <s (𝐵 -_s 1_s )) → 𝑞 ∈ ℕ_0s)
66		peano2n0s 28430	. . . . . . . . . . . . 13 ⊢ (𝑞 ∈ ℕ_0s → (𝑞 +_s 1_s ) ∈ ℕ_0s)
67	65, 66	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) ∧ 𝑞 <s (𝐵 -_s 1_s )) → (𝑞 +_s 1_s ) ∈ ℕ_0s)
68	49	nnn0sd 28428	. . . . . . . . . . . . . . . 16 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝐵 ∈ ℕ_0s)
69		simprl 780	. . . . . . . . . . . . . . . 16 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝑝 ∈ ℕ_0s)
70		n0mulscl 28445	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ ℕ_0s ∧ 𝑝 ∈ ℕ_0s) → (𝐵 ·_s 𝑝) ∈ ℕ_0s)
71	68, 69, 70	syl2anc 593	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 ·_s 𝑝) ∈ ℕ_0s)
72	71	n0nod 28425	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 ·_s 𝑝) ∈ No )
73	59	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 1_s ∈ No )
74	72, 54, 73	addsassd 28106	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s (𝑞 +_s 1_s )))
75	74	adantr 484	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) ∧ 𝑞 <s (𝐵 -_s 1_s )) → (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s (𝑞 +_s 1_s )))
76	54, 73, 58	ltaddsubsd 28191	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝑞 +_s 1_s ) <s 𝐵 ↔ 𝑞 <s (𝐵 -_s 1_s )))
77	76	biimpar 481	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) ∧ 𝑞 <s (𝐵 -_s 1_s )) → (𝑞 +_s 1_s ) <s 𝐵)
78		oveq2 7404	. . . . . . . . . . . . . . . 16 ⊢ (𝑟 = 𝑝 → (𝐵 ·_s 𝑟) = (𝐵 ·_s 𝑝))
79	78	oveq1d 7411	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑝 → ((𝐵 ·_s 𝑟) +_s 𝑠) = ((𝐵 ·_s 𝑝) +_s 𝑠))
80	79	eqeq2d 2774	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑝 → ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ↔ (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑠)))
81	80	anbi1d 640	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑝 → (((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
82		oveq2 7404	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = (𝑞 +_s 1_s ) → ((𝐵 ·_s 𝑝) +_s 𝑠) = ((𝐵 ·_s 𝑝) +_s (𝑞 +_s 1_s )))
83	82	eqeq2d 2774	. . . . . . . . . . . . . 14 ⊢ (𝑠 = (𝑞 +_s 1_s ) → ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑠) ↔ (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s (𝑞 +_s 1_s ))))
84		breq1 5104	. . . . . . . . . . . . . 14 ⊢ (𝑠 = (𝑞 +_s 1_s ) → (𝑠 <s 𝐵 ↔ (𝑞 +_s 1_s ) <s 𝐵))
85	83, 84	anbi12d 641	. . . . . . . . . . . . 13 ⊢ (𝑠 = (𝑞 +_s 1_s ) → (((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s (𝑞 +_s 1_s )) ∧ (𝑞 +_s 1_s ) <s 𝐵)))
86	81, 85	rspc2ev 3595	. . . . . . . . . . . 12 ⊢ ((𝑝 ∈ ℕ_0s ∧ (𝑞 +_s 1_s ) ∈ ℕ_0s ∧ ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s (𝑞 +_s 1_s )) ∧ (𝑞 +_s 1_s ) <s 𝐵)) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))
87	64, 67, 75, 77, 86	syl112anc 1395	. . . . . . . . . . 11 ⊢ ((((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) ∧ 𝑞 <s (𝐵 -_s 1_s )) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))
88	87	ex 416	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 <s (𝐵 -_s 1_s ) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
89		peano2n0s 28430	. . . . . . . . . . . . 13 ⊢ (𝑝 ∈ ℕ_0s → (𝑝 +_s 1_s ) ∈ ℕ_0s)
90	69, 89	syl 17	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑝 +_s 1_s ) ∈ ℕ_0s)
91	58	mulsridd 28214	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 ·_s 1_s ) = 𝐵)
92	91	oveq2d 7412	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝐵 ·_s 𝑝) +_s (𝐵 ·_s 1_s )) = ((𝐵 ·_s 𝑝) +_s 𝐵))
93	69	n0nod 28425	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 𝑝 ∈ No )
94	58, 93, 73	addsdid 28256	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 ·_s (𝑝 +_s 1_s )) = ((𝐵 ·_s 𝑝) +_s (𝐵 ·_s 1_s )))
95	61	oveq2d 7412	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝐵 ·_s 𝑝) +_s ((𝐵 -_s 1_s ) +_s 1_s )) = ((𝐵 ·_s 𝑝) +_s 𝐵))
96	92, 94, 95	3eqtr4rd 2809	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝐵 ·_s 𝑝) +_s ((𝐵 -_s 1_s ) +_s 1_s )) = (𝐵 ·_s (𝑝 +_s 1_s )))
97	72, 55, 73	addsassd 28106	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑝) +_s ((𝐵 -_s 1_s ) +_s 1_s )))
98		peano2no 28084	. . . . . . . . . . . . . . . 16 ⊢ (𝑝 ∈ No → (𝑝 +_s 1_s ) ∈ No )
99	93, 98	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑝 +_s 1_s ) ∈ No )
100	58, 99	mulscld 28235	. . . . . . . . . . . . . 14 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝐵 ·_s (𝑝 +_s 1_s )) ∈ No )
101	100	addsridd 28065	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s ) = (𝐵 ·_s (𝑝 +_s 1_s )))
102	96, 97, 101	3eqtr4d 2808	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s ))
103	49, 35	syl 17	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → 0_s <s 𝐵)
104		oveq2 7404	. . . . . . . . . . . . . . . . 17 ⊢ (𝑟 = (𝑝 +_s 1_s ) → (𝐵 ·_s 𝑟) = (𝐵 ·_s (𝑝 +_s 1_s )))
105	104	oveq1d 7411	. . . . . . . . . . . . . . . 16 ⊢ (𝑟 = (𝑝 +_s 1_s ) → ((𝐵 ·_s 𝑟) +_s 𝑠) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 𝑠))
106	105	eqeq2d 2774	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = (𝑝 +_s 1_s ) → ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ↔ (((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 𝑠)))
107	106	anbi1d 640	. . . . . . . . . . . . . 14 ⊢ (𝑟 = (𝑝 +_s 1_s ) → (((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
108		oveq2 7404	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 0_s → ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 𝑠) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s ))
109	108	eqeq2d 2774	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 0_s → ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 𝑠) ↔ (((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s )))
110		breq1 5104	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 0_s → (𝑠 <s 𝐵 ↔ 0_s <s 𝐵))
111	109, 110	anbi12d 641	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 0_s → (((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s ) ∧ 0_s <s 𝐵)))
112	107, 111	rspc2ev 3595	. . . . . . . . . . . . 13 ⊢ (((𝑝 +_s 1_s ) ∈ ℕ_0s ∧ 0_s ∈ ℕ_0s ∧ ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s ) ∧ 0_s <s 𝐵)) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))
113	36, 112	mp3an2 1471	. . . . . . . . . . . 12 ⊢ (((𝑝 +_s 1_s ) ∈ ℕ_0s ∧ ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s (𝑝 +_s 1_s )) +_s 0_s ) ∧ 0_s <s 𝐵)) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))
114	90, 102, 103, 113	syl12anc 847	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))
115		oveq2 7404	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = (𝐵 -_s 1_s ) → ((𝐵 ·_s 𝑝) +_s 𝑞) = ((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )))
116	115	oveq1d 7411	. . . . . . . . . . . . . 14 ⊢ (𝑞 = (𝐵 -_s 1_s ) → (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = (((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ))
117	116	eqeq1d 2765	. . . . . . . . . . . . 13 ⊢ (𝑞 = (𝐵 -_s 1_s ) → ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ↔ (((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠)))
118	117	anbi1d 640	. . . . . . . . . . . 12 ⊢ (𝑞 = (𝐵 -_s 1_s ) → (((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
119	118	2rexbidv 3228	. . . . . . . . . . 11 ⊢ (𝑞 = (𝐵 -_s 1_s ) → (∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s (𝐵 -_s 1_s )) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
120	114, 119	syl5ibrcom 249	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 = (𝐵 -_s 1_s ) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
121	88, 120	jaod 870	. . . . . . . . 9 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝑞 <s (𝐵 -_s 1_s ) ∨ 𝑞 = (𝐵 -_s 1_s )) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
122	63, 121	sylbid 242	. . . . . . . 8 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑞 <s 𝐵 → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
123		oveq1 7403	. . . . . . . . . . . 12 ⊢ (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) → (𝑎 +_s 1_s ) = (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ))
124	123	eqeq1d 2765	. . . . . . . . . . 11 ⊢ (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) → ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ↔ (((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠)))
125	124	anbi1d 640	. . . . . . . . . 10 ⊢ (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) → (((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
126	125	2rexbidv 3228	. . . . . . . . 9 ⊢ (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) → (∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵) ↔ ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
127	126	imbi2d 342	. . . . . . . 8 ⊢ (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) → ((𝑞 <s 𝐵 → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)) ↔ (𝑞 <s 𝐵 → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((((𝐵 ·_s 𝑝) +_s 𝑞) +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))))
128	122, 127	syl5ibrcom 249	. . . . . . 7 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) → (𝑞 <s 𝐵 → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))))
129	128	impd 414	. . . . . 6 ⊢ (((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) ∧ (𝑝 ∈ ℕ_0s ∧ 𝑞 ∈ ℕ_0s)) → ((𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
130	129	rexlimdvva 3220	. . . . 5 ⊢ ((𝑎 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵)))
131	130	ex 416	. . . 4 ⊢ (𝑎 ∈ ℕ_0s → (𝐵 ∈ ℕ_s → (∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵) → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))))
132	131	a2d 29	. . 3 ⊢ (𝑎 ∈ ℕ_0s → ((𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝑎 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)) → (𝐵 ∈ ℕ_s → ∃𝑟 ∈ ℕ_0s ∃𝑠 ∈ ℕ_0s ((𝑎 +_s 1_s ) = ((𝐵 ·_s 𝑟) +_s 𝑠) ∧ 𝑠 <s 𝐵))))
133	4, 8, 22, 26, 47, 132	n0sind 28433	. 2 ⊢ (𝐴 ∈ ℕ_0s → (𝐵 ∈ ℕ_s → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵)))
134	133	imp 410	1 ⊢ ((𝐴 ∈ ℕ_0s ∧ 𝐵 ∈ ℕ_s) → ∃𝑝 ∈ ℕ_0s ∃𝑞 ∈ ℕ_0s (𝐴 = ((𝐵 ·_s 𝑝) +_s 𝑞) ∧ 𝑞 <s 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 = wceq 1561 ∈ wcel 2143 ∃wrex 3087 class class class wbr 5101 (class class class)co 7396 No csur 27711 <s clts 27712 ≤s cles 27815 0_s c0s 27905 1_s c1s 27906 +_s cadds 28059 -_s csubs 28120 ·_s cmuls 28206 ℕ_0scn0s 28412 ℕ_scnns 28413

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-ot 4592 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-se 5602 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-nadd 8636 df-no 27714 df-lts 27715 df-bday 27716 df-les 27816 df-slts 27858 df-cuts 27860 df-0s 27907 df-1s 27908 df-made 27927 df-old 27928 df-left 27930 df-right 27931 df-norec 28038 df-norec2 28049 df-adds 28060 df-negs 28121 df-subs 28122 df-muls 28207 df-n0s 28414 df-nns 28415

This theorem is referenced by: z12sge0 28583

W3C validator