lgsdir2lem2 - Intuitionistic Logic Explorer

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

Theorem lgsdir2lem2 15831

Description: Lemma for lgsdir2 15835. (Contributed by Mario Carneiro, 4-Feb-2015.)

**Hypotheses**
Ref	Expression
lgsdir2lem2.1	⊢ (𝐾 ∈ ℤ ∧ 2 ∥ (𝐾 + 1) ∧ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝐾) → (𝐴 mod 8) ∈ 𝑆)))
lgsdir2lem2.2	⊢ 𝑀 = (𝐾 + 1)
lgsdir2lem2.3	⊢ 𝑁 = (𝑀 + 1)
lgsdir2lem2.4	⊢ 𝑁 ∈ 𝑆

**Assertion**
Ref	Expression
lgsdir2lem2	⊢ (𝑁 ∈ ℤ ∧ 2 ∥ (𝑁 + 1) ∧ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝑁) → (𝐴 mod 8) ∈ 𝑆)))

**Proof of Theorem lgsdir2lem2**
Step	Hyp	Ref	Expression
1		lgsdir2lem2.3	. . 3 ⊢ 𝑁 = (𝑀 + 1)
2		lgsdir2lem2.2	. . . . 5 ⊢ 𝑀 = (𝐾 + 1)
3		lgsdir2lem2.1	. . . . . . 7 ⊢ (𝐾 ∈ ℤ ∧ 2 ∥ (𝐾 + 1) ∧ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝐾) → (𝐴 mod 8) ∈ 𝑆)))
4	3	simp1i 1033	. . . . . 6 ⊢ 𝐾 ∈ ℤ
5		peano2z 9560	. . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 + 1) ∈ ℤ)
6	4, 5	ax-mp 5	. . . . 5 ⊢ (𝐾 + 1) ∈ ℤ
7	2, 6	eqeltri 2304	. . . 4 ⊢ 𝑀 ∈ ℤ
8		peano2z 9560	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝑀 + 1) ∈ ℤ)
9	7, 8	ax-mp 5	. . 3 ⊢ (𝑀 + 1) ∈ ℤ
10	1, 9	eqeltri 2304	. 2 ⊢ 𝑁 ∈ ℤ
11	3	simp2i 1034	. . . 4 ⊢ 2 ∥ (𝐾 + 1)
12		2z 9552	. . . . 5 ⊢ 2 ∈ ℤ
13		dvdsadd 12460	. . . . 5 ⊢ ((2 ∈ ℤ ∧ (𝐾 + 1) ∈ ℤ) → (2 ∥ (𝐾 + 1) ↔ 2 ∥ (2 + (𝐾 + 1))))
14	12, 6, 13	mp2an 426	. . . 4 ⊢ (2 ∥ (𝐾 + 1) ↔ 2 ∥ (2 + (𝐾 + 1)))
15	11, 14	mpbi 145	. . 3 ⊢ 2 ∥ (2 + (𝐾 + 1))
16		zcn 9529	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ)
17	4, 16	ax-mp 5	. . . . . . . . . 10 ⊢ 𝐾 ∈ ℂ
18		ax-1cn 8168	. . . . . . . . . 10 ⊢ 1 ∈ ℂ
19	17, 18	addcomi 8366	. . . . . . . . 9 ⊢ (𝐾 + 1) = (1 + 𝐾)
20	2, 19	eqtri 2252	. . . . . . . 8 ⊢ 𝑀 = (1 + 𝐾)
21	20	oveq1i 6038	. . . . . . 7 ⊢ (𝑀 + 1) = ((1 + 𝐾) + 1)
22	1, 21	eqtri 2252	. . . . . 6 ⊢ 𝑁 = ((1 + 𝐾) + 1)
23		df-2 9245	. . . . . . . 8 ⊢ 2 = (1 + 1)
24	23	oveq1i 6038	. . . . . . 7 ⊢ (2 + 𝐾) = ((1 + 1) + 𝐾)
25	18, 17, 18	add32i 8386	. . . . . . 7 ⊢ ((1 + 𝐾) + 1) = ((1 + 1) + 𝐾)
26	24, 25	eqtr4i 2255	. . . . . 6 ⊢ (2 + 𝐾) = ((1 + 𝐾) + 1)
27	22, 26	eqtr4i 2255	. . . . 5 ⊢ 𝑁 = (2 + 𝐾)
28	27	oveq1i 6038	. . . 4 ⊢ (𝑁 + 1) = ((2 + 𝐾) + 1)
29		2cn 9257	. . . . 5 ⊢ 2 ∈ ℂ
30	29, 17, 18	addassi 8230	. . . 4 ⊢ ((2 + 𝐾) + 1) = (2 + (𝐾 + 1))
31	28, 30	eqtri 2252	. . 3 ⊢ (𝑁 + 1) = (2 + (𝐾 + 1))
32	15, 31	breqtrri 4120	. 2 ⊢ 2 ∥ (𝑁 + 1)
33		elfzuz2 10309	. . . . 5 ⊢ ((𝐴 mod 8) ∈ (0...𝑁) → 𝑁 ∈ (ℤ_≥‘0))
34		fzm1 10380	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘0) → ((𝐴 mod 8) ∈ (0...𝑁) ↔ ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) ∨ (𝐴 mod 8) = 𝑁)))
35	33, 34	syl 14	. . . 4 ⊢ ((𝐴 mod 8) ∈ (0...𝑁) → ((𝐴 mod 8) ∈ (0...𝑁) ↔ ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) ∨ (𝐴 mod 8) = 𝑁)))
36	35	ibi 176	. . 3 ⊢ ((𝐴 mod 8) ∈ (0...𝑁) → ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) ∨ (𝐴 mod 8) = 𝑁))
37		elfzuz2 10309	. . . . . . . 8 ⊢ ((𝐴 mod 8) ∈ (0...𝑀) → 𝑀 ∈ (ℤ_≥‘0))
38		fzm1 10380	. . . . . . . 8 ⊢ (𝑀 ∈ (ℤ_≥‘0) → ((𝐴 mod 8) ∈ (0...𝑀) ↔ ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀)))
39	37, 38	syl 14	. . . . . . 7 ⊢ ((𝐴 mod 8) ∈ (0...𝑀) → ((𝐴 mod 8) ∈ (0...𝑀) ↔ ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀)))
40	39	ibi 176	. . . . . 6 ⊢ ((𝐴 mod 8) ∈ (0...𝑀) → ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀))
41		zcn 9529	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
42	7, 41	ax-mp 5	. . . . . . . 8 ⊢ 𝑀 ∈ ℂ
43	42, 18, 1	mvrraddi 8439	. . . . . . 7 ⊢ (𝑁 − 1) = 𝑀
44	43	oveq2i 6039	. . . . . 6 ⊢ (0...(𝑁 − 1)) = (0...𝑀)
45	40, 44	eleq2s 2326	. . . . 5 ⊢ ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) → ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀))
46	17, 18, 2	mvrraddi 8439	. . . . . . . . 9 ⊢ (𝑀 − 1) = 𝐾
47	46	oveq2i 6039	. . . . . . . 8 ⊢ (0...(𝑀 − 1)) = (0...𝐾)
48	47	eleq2i 2298	. . . . . . 7 ⊢ ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ↔ (𝐴 mod 8) ∈ (0...𝐾))
49	3	simp3i 1035	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝐾) → (𝐴 mod 8) ∈ 𝑆))
50	48, 49	biimtrid 152	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) → (𝐴 mod 8) ∈ 𝑆))
51		2nn 9348	. . . . . . . . . . 11 ⊢ 2 ∈ ℕ
52		8nn 9354	. . . . . . . . . . 11 ⊢ 8 ∈ ℕ
53		4z 9554	. . . . . . . . . . . . . 14 ⊢ 4 ∈ ℤ
54		dvdsmul2 12438	. . . . . . . . . . . . . 14 ⊢ ((4 ∈ ℤ ∧ 2 ∈ ℤ) → 2 ∥ (4 · 2))
55	53, 12, 54	mp2an 426	. . . . . . . . . . . . 13 ⊢ 2 ∥ (4 · 2)
56		4t2e8 9345	. . . . . . . . . . . . 13 ⊢ (4 · 2) = 8
57	55, 56	breqtri 4118	. . . . . . . . . . . 12 ⊢ 2 ∥ 8
58		dvdsmod 12486	. . . . . . . . . . . 12 ⊢ (((2 ∈ ℕ ∧ 8 ∈ ℕ ∧ 𝐴 ∈ ℤ) ∧ 2 ∥ 8) → (2 ∥ (𝐴 mod 8) ↔ 2 ∥ 𝐴))
59	57, 58	mpan2 425	. . . . . . . . . . 11 ⊢ ((2 ∈ ℕ ∧ 8 ∈ ℕ ∧ 𝐴 ∈ ℤ) → (2 ∥ (𝐴 mod 8) ↔ 2 ∥ 𝐴))
60	51, 52, 59	mp3an12 1364	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℤ → (2 ∥ (𝐴 mod 8) ↔ 2 ∥ 𝐴))
61	60	notbid 673	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → (¬ 2 ∥ (𝐴 mod 8) ↔ ¬ 2 ∥ 𝐴))
62	61	biimpar 297	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ¬ 2 ∥ (𝐴 mod 8))
63	11, 2	breqtrri 4120	. . . . . . . . 9 ⊢ 2 ∥ 𝑀
64		id 19	. . . . . . . . 9 ⊢ ((𝐴 mod 8) = 𝑀 → (𝐴 mod 8) = 𝑀)
65	63, 64	breqtrrid 4131	. . . . . . . 8 ⊢ ((𝐴 mod 8) = 𝑀 → 2 ∥ (𝐴 mod 8))
66	62, 65	nsyl 633	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ¬ (𝐴 mod 8) = 𝑀)
67	66	pm2.21d 624	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) = 𝑀 → (𝐴 mod 8) ∈ 𝑆))
68	50, 67	jaod 725	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → (((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀) → (𝐴 mod 8) ∈ 𝑆))
69	45, 68	syl5 32	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) → (𝐴 mod 8) ∈ 𝑆))
70		lgsdir2lem2.4	. . . . . 6 ⊢ 𝑁 ∈ 𝑆
71		eleq1 2294	. . . . . 6 ⊢ ((𝐴 mod 8) = 𝑁 → ((𝐴 mod 8) ∈ 𝑆 ↔ 𝑁 ∈ 𝑆))
72	70, 71	mpbiri 168	. . . . 5 ⊢ ((𝐴 mod 8) = 𝑁 → (𝐴 mod 8) ∈ 𝑆)
73	72	a1i 9	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) = 𝑁 → (𝐴 mod 8) ∈ 𝑆))
74	69, 73	jaod 725	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → (((𝐴 mod 8) ∈ (0...(𝑁 − 1)) ∨ (𝐴 mod 8) = 𝑁) → (𝐴 mod 8) ∈ 𝑆))
75	36, 74	syl5 32	. 2 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝑁) → (𝐴 mod 8) ∈ 𝑆))
76	10, 32, 75	3pm3.2i 1202	1 ⊢ (𝑁 ∈ ℤ ∧ 2 ∥ (𝑁 + 1) ∧ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝑁) → (𝐴 mod 8) ∈ 𝑆)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 class class class wbr 4093 ‘cfv 5333 (class class class)co 6028 ℂcc 8073 0cc0 8075 1c1 8076 + caddc 8078 · cmul 8080 − cmin 8393 ℕcn 9186 2c2 9237 4c4 9239 8c8 9243 ℤcz 9524 ℤ_≥cuz 9800 ...cfz 10288 mod cmo 10630 ∥ cdvds 12411

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194

This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-po 4399 df-iso 4400 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-reap 8798 df-ap 8805 df-div 8896 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-5 9248 df-6 9249 df-7 9250 df-8 9251 df-n0 9446 df-z 9525 df-uz 9801 df-q 9899 df-rp 9934 df-fz 10289 df-fl 10576 df-mod 10631 df-dvds 12412

This theorem is referenced by: lgsdir2lem3 15832

W3C validator