modsumfzodifsn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > modsumfzodifsn		GIF version

Theorem modsumfzodifsn 10398

Description: The sum of a number within a half-open range of positive integers is an element of the corresponding open range of nonnegative integers with one excluded integer modulo the excluded integer. (Contributed by AV, 19-Mar-2021.)

**Assertion**
Ref	Expression
modsumfzodifsn	⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) mod 𝑁) ∈ ((0..^𝑁) ∖ {𝐽}))

**Proof of Theorem modsumfzodifsn**
Step	Hyp	Ref	Expression
1		elfzoelz 10149	. . . . . . . 8 ⊢ (𝐾 ∈ (1..^𝑁) → 𝐾 ∈ ℤ)
2	1	adantl 277	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ∈ ℤ)
3		zq 9628	. . . . . . 7 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℚ)
4	2, 3	syl 14	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ∈ ℚ)
5		elfzo0 10184	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (0..^𝑁) ↔ (𝐽 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ 𝐽 < 𝑁))
6	5	biimpi 120	. . . . . . . . . 10 ⊢ (𝐽 ∈ (0..^𝑁) → (𝐽 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ 𝐽 < 𝑁))
7	6	adantr 276	. . . . . . . . 9 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐽 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ 𝐽 < 𝑁))
8	7	simp1d 1009	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 ∈ ℕ₀)
9	8	nn0zd 9375	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 ∈ ℤ)
10		zq 9628	. . . . . . 7 ⊢ (𝐽 ∈ ℤ → 𝐽 ∈ ℚ)
11	9, 10	syl 14	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 ∈ ℚ)
12		qaddcl 9637	. . . . . 6 ⊢ ((𝐾 ∈ ℚ ∧ 𝐽 ∈ ℚ) → (𝐾 + 𝐽) ∈ ℚ)
13	4, 11, 12	syl2anc 411	. . . . 5 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ∈ ℚ)
14	13	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ∈ ℚ)
15	7	simp2d 1010	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝑁 ∈ ℕ)
16		nnq 9635	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℚ)
17	15, 16	syl 14	. . . . 5 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝑁 ∈ ℚ)
18	17	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → 𝑁 ∈ ℚ)
19		elfzo1 10192	. . . . . . . . . . 11 ⊢ (𝐾 ∈ (1..^𝑁) ↔ (𝐾 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐾 < 𝑁))
20	19	biimpi 120	. . . . . . . . . 10 ⊢ (𝐾 ∈ (1..^𝑁) → (𝐾 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐾 < 𝑁))
21	20	adantl 277	. . . . . . . . 9 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝐾 < 𝑁))
22	21	simp1d 1009	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ∈ ℕ)
23	22	nnnn0d 9231	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ∈ ℕ₀)
24	23, 8	nn0addcld 9235	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ∈ ℕ₀)
25	24	nn0ge0d 9234	. . . . 5 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 0 ≤ (𝐾 + 𝐽))
26	25	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → 0 ≤ (𝐾 + 𝐽))
27		simpr 110	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) < 𝑁)
28		modqid 10351	. . . 4 ⊢ ((((𝐾 + 𝐽) ∈ ℚ ∧ 𝑁 ∈ ℚ) ∧ (0 ≤ (𝐾 + 𝐽) ∧ (𝐾 + 𝐽) < 𝑁)) → ((𝐾 + 𝐽) mod 𝑁) = (𝐾 + 𝐽))
29	14, 18, 26, 27, 28	syl22anc 1239	. . 3 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) mod 𝑁) = (𝐾 + 𝐽))
30	24	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ∈ ℕ₀)
31	15	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → 𝑁 ∈ ℕ)
32		elfzo0 10184	. . . . 5 ⊢ ((𝐾 + 𝐽) ∈ (0..^𝑁) ↔ ((𝐾 + 𝐽) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ (𝐾 + 𝐽) < 𝑁))
33	30, 31, 27, 32	syl3anbrc 1181	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ∈ (0..^𝑁))
34	2	zcnd 9378	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ∈ ℂ)
35		0cnd 7952	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 0 ∈ ℂ)
36	8	nn0cnd 9233	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 ∈ ℂ)
37	22	nnne0d 8966	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ≠ 0)
38	34, 35, 36, 37	addneintr2d 8148	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ≠ (0 + 𝐽))
39	36	addid2d 8109	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (0 + 𝐽) = 𝐽)
40	38, 39	neeqtrd 2375	. . . . 5 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ≠ 𝐽)
41	40	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ≠ 𝐽)
42		eldifsn 3721	. . . 4 ⊢ ((𝐾 + 𝐽) ∈ ((0..^𝑁) ∖ {𝐽}) ↔ ((𝐾 + 𝐽) ∈ (0..^𝑁) ∧ (𝐾 + 𝐽) ≠ 𝐽))
43	33, 41, 42	sylanbrc 417	. . 3 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ∈ ((0..^𝑁) ∖ {𝐽}))
44	29, 43	eqeltrd 2254	. 2 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) mod 𝑁) ∈ ((0..^𝑁) ∖ {𝐽}))
45	15	nncnd 8935	. . . . . . . . 9 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝑁 ∈ ℂ)
46	45	adantr 276	. . . . . . . 8 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 𝑁 ∈ ℂ)
47	46	mulm1d 8369	. . . . . . 7 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (-1 · 𝑁) = -𝑁)
48	47	oveq2d 5893	. . . . . 6 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) + (-1 · 𝑁)) = ((𝐾 + 𝐽) + -𝑁))
49	34, 36	addcld 7979	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ∈ ℂ)
50	49, 45	negsubd 8276	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) + -𝑁) = ((𝐾 + 𝐽) − 𝑁))
51	50	adantr 276	. . . . . 6 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) + -𝑁) = ((𝐾 + 𝐽) − 𝑁))
52	48, 51	eqtrd 2210	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) + (-1 · 𝑁)) = ((𝐾 + 𝐽) − 𝑁))
53	52	oveq1d 5892	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (((𝐾 + 𝐽) + (-1 · 𝑁)) mod 𝑁) = (((𝐾 + 𝐽) − 𝑁) mod 𝑁))
54	13	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ∈ ℚ)
55		neg1z 9287	. . . . . 6 ⊢ -1 ∈ ℤ
56	55	a1i 9	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → -1 ∈ ℤ)
57	17	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 𝑁 ∈ ℚ)
58	15	nngt0d 8965	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 0 < 𝑁)
59	58	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 0 < 𝑁)
60		modqcyc 10361	. . . . 5 ⊢ ((((𝐾 + 𝐽) ∈ ℚ ∧ -1 ∈ ℤ) ∧ (𝑁 ∈ ℚ ∧ 0 < 𝑁)) → (((𝐾 + 𝐽) + (-1 · 𝑁)) mod 𝑁) = ((𝐾 + 𝐽) mod 𝑁))
61	54, 56, 57, 59, 60	syl22anc 1239	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (((𝐾 + 𝐽) + (-1 · 𝑁)) mod 𝑁) = ((𝐾 + 𝐽) mod 𝑁))
62		qsubcl 9640	. . . . . . 7 ⊢ (((𝐾 + 𝐽) ∈ ℚ ∧ 𝑁 ∈ ℚ) → ((𝐾 + 𝐽) − 𝑁) ∈ ℚ)
63	13, 17, 62	syl2anc 411	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) − 𝑁) ∈ ℚ)
64	63	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) ∈ ℚ)
65		simpr 110	. . . . . . 7 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ¬ (𝐾 + 𝐽) < 𝑁)
66	15	nnred 8934	. . . . . . . . 9 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝑁 ∈ ℝ)
67	66	adantr 276	. . . . . . . 8 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 𝑁 ∈ ℝ)
68	24	nn0red 9232	. . . . . . . . 9 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ∈ ℝ)
69	68	adantr 276	. . . . . . . 8 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (𝐾 + 𝐽) ∈ ℝ)
70	67, 69	lenltd 8077	. . . . . . 7 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (𝑁 ≤ (𝐾 + 𝐽) ↔ ¬ (𝐾 + 𝐽) < 𝑁))
71	65, 70	mpbird 167	. . . . . 6 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 𝑁 ≤ (𝐾 + 𝐽))
72	69, 67	subge0d 8494	. . . . . 6 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (0 ≤ ((𝐾 + 𝐽) − 𝑁) ↔ 𝑁 ≤ (𝐾 + 𝐽)))
73	71, 72	mpbird 167	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 0 ≤ ((𝐾 + 𝐽) − 𝑁))
74	2	zred 9377	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ∈ ℝ)
75	8	nn0red 9232	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 ∈ ℝ)
76	21	simp3d 1011	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 < 𝑁)
77	7	simp3d 1011	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 < 𝑁)
78	74, 75, 66, 66, 76, 77	lt2addd 8526	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) < (𝑁 + 𝑁))
79	68, 66, 66	ltsubaddd 8500	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (((𝐾 + 𝐽) − 𝑁) < 𝑁 ↔ (𝐾 + 𝐽) < (𝑁 + 𝑁)))
80	78, 79	mpbird 167	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) − 𝑁) < 𝑁)
81	80	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) < 𝑁)
82		modqid 10351	. . . . 5 ⊢ (((((𝐾 + 𝐽) − 𝑁) ∈ ℚ ∧ 𝑁 ∈ ℚ) ∧ (0 ≤ ((𝐾 + 𝐽) − 𝑁) ∧ ((𝐾 + 𝐽) − 𝑁) < 𝑁)) → (((𝐾 + 𝐽) − 𝑁) mod 𝑁) = ((𝐾 + 𝐽) − 𝑁))
83	64, 57, 73, 81, 82	syl22anc 1239	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → (((𝐾 + 𝐽) − 𝑁) mod 𝑁) = ((𝐾 + 𝐽) − 𝑁))
84	53, 61, 83	3eqtr3d 2218	. . 3 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) mod 𝑁) = ((𝐾 + 𝐽) − 𝑁))
85	24	nn0zd 9375	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 + 𝐽) ∈ ℤ)
86	15	nnzd 9376	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝑁 ∈ ℤ)
87	85, 86	zsubcld 9382	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) − 𝑁) ∈ ℤ)
88	87	adantr 276	. . . . . 6 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) ∈ ℤ)
89		elnn0z 9268	. . . . . 6 ⊢ (((𝐾 + 𝐽) − 𝑁) ∈ ℕ₀ ↔ (((𝐾 + 𝐽) − 𝑁) ∈ ℤ ∧ 0 ≤ ((𝐾 + 𝐽) − 𝑁)))
90	88, 73, 89	sylanbrc 417	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) ∈ ℕ₀)
91	15	adantr 276	. . . . 5 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → 𝑁 ∈ ℕ)
92		elfzo0 10184	. . . . 5 ⊢ (((𝐾 + 𝐽) − 𝑁) ∈ (0..^𝑁) ↔ (((𝐾 + 𝐽) − 𝑁) ∈ ℕ₀ ∧ 𝑁 ∈ ℕ ∧ ((𝐾 + 𝐽) − 𝑁) < 𝑁))
93	90, 91, 81, 92	syl3anbrc 1181	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) ∈ (0..^𝑁))
94	34, 45	subcld 8270	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 − 𝑁) ∈ ℂ)
95	74, 76	ltned 8073	. . . . . . . 8 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐾 ≠ 𝑁)
96	34, 45, 95	subne0d 8279	. . . . . . 7 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → (𝐾 − 𝑁) ≠ 0)
97	94, 35, 36, 96	addneintr2d 8148	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 − 𝑁) + 𝐽) ≠ (0 + 𝐽))
98	34, 36, 45	addsubd 8291	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) − 𝑁) = ((𝐾 − 𝑁) + 𝐽))
99	39	eqcomd 2183	. . . . . 6 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → 𝐽 = (0 + 𝐽))
100	97, 98, 99	3netr4d 2380	. . . . 5 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) − 𝑁) ≠ 𝐽)
101	100	adantr 276	. . . 4 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) ≠ 𝐽)
102		eldifsn 3721	. . . 4 ⊢ (((𝐾 + 𝐽) − 𝑁) ∈ ((0..^𝑁) ∖ {𝐽}) ↔ (((𝐾 + 𝐽) − 𝑁) ∈ (0..^𝑁) ∧ ((𝐾 + 𝐽) − 𝑁) ≠ 𝐽))
103	93, 101, 102	sylanbrc 417	. . 3 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) − 𝑁) ∈ ((0..^𝑁) ∖ {𝐽}))
104	84, 103	eqeltrd 2254	. 2 ⊢ (((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) ∧ ¬ (𝐾 + 𝐽) < 𝑁) → ((𝐾 + 𝐽) mod 𝑁) ∈ ((0..^𝑁) ∖ {𝐽}))
105		zdclt 9332	. . . 4 ⊢ (((𝐾 + 𝐽) ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID (𝐾 + 𝐽) < 𝑁)
106		exmiddc 836	. . . 4 ⊢ (DECID (𝐾 + 𝐽) < 𝑁 → ((𝐾 + 𝐽) < 𝑁 ∨ ¬ (𝐾 + 𝐽) < 𝑁))
107	105, 106	syl 14	. . 3 ⊢ (((𝐾 + 𝐽) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 + 𝐽) < 𝑁 ∨ ¬ (𝐾 + 𝐽) < 𝑁))
108	85, 86, 107	syl2anc 411	. 2 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) < 𝑁 ∨ ¬ (𝐾 + 𝐽) < 𝑁))
109	44, 104, 108	mpjaodan 798	1 ⊢ ((𝐽 ∈ (0..^𝑁) ∧ 𝐾 ∈ (1..^𝑁)) → ((𝐾 + 𝐽) mod 𝑁) ∈ ((0..^𝑁) ∖ {𝐽}))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 708 DECID wdc 834 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ≠ wne 2347 ∖ cdif 3128 {csn 3594 class class class wbr 4005 (class class class)co 5877 ℂcc 7811 ℝcr 7812 0cc0 7813 1c1 7814 + caddc 7816 · cmul 7818 < clt 7994 ≤ cle 7995 − cmin 8130 -cneg 8131 ℕcn 8921 ℕ₀cn0 9178 ℤcz 9255 ℚcq 9621 ..^cfzo 10144 mod cmo 10324

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-mulrcl 7912 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-precex 7923 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-apti 7928 ax-pre-ltadd 7929 ax-pre-mulgt0 7930 ax-pre-mulext 7931 ax-arch 7932

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-id 4295 df-po 4298 df-iso 4299 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-reap 8534 df-ap 8541 df-div 8632 df-inn 8922 df-n0 9179 df-z 9256 df-uz 9531 df-q 9622 df-rp 9656 df-fz 10011 df-fzo 10145 df-fl 10272 df-mod 10325

This theorem is referenced by: (None)

W3C validator