lgsdir2lem2 - Intuitionistic Logic Explorer

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

Theorem lgsdir2lem2 14916

Description: Lemma for lgsdir2 14920. (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 1008	. . . . . 6 ⊢ 𝐾 ∈ ℤ
5		peano2z 9324	. . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 + 1) ∈ ℤ)
6	4, 5	ax-mp 5	. . . . 5 ⊢ (𝐾 + 1) ∈ ℤ
7	2, 6	eqeltri 2262	. . . 4 ⊢ 𝑀 ∈ ℤ
8		peano2z 9324	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝑀 + 1) ∈ ℤ)
9	7, 8	ax-mp 5	. . 3 ⊢ (𝑀 + 1) ∈ ℤ
10	1, 9	eqeltri 2262	. 2 ⊢ 𝑁 ∈ ℤ
11	3	simp2i 1009	. . . 4 ⊢ 2 ∥ (𝐾 + 1)
12		2z 9316	. . . . 5 ⊢ 2 ∈ ℤ
13		dvdsadd 11884	. . . . 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 9293	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ)
17	4, 16	ax-mp 5	. . . . . . . . . 10 ⊢ 𝐾 ∈ ℂ
18		ax-1cn 7939	. . . . . . . . . 10 ⊢ 1 ∈ ℂ
19	17, 18	addcomi 8136	. . . . . . . . 9 ⊢ (𝐾 + 1) = (1 + 𝐾)
20	2, 19	eqtri 2210	. . . . . . . 8 ⊢ 𝑀 = (1 + 𝐾)
21	20	oveq1i 5910	. . . . . . 7 ⊢ (𝑀 + 1) = ((1 + 𝐾) + 1)
22	1, 21	eqtri 2210	. . . . . 6 ⊢ 𝑁 = ((1 + 𝐾) + 1)
23		df-2 9013	. . . . . . . 8 ⊢ 2 = (1 + 1)
24	23	oveq1i 5910	. . . . . . 7 ⊢ (2 + 𝐾) = ((1 + 1) + 𝐾)
25	18, 17, 18	add32i 8156	. . . . . . 7 ⊢ ((1 + 𝐾) + 1) = ((1 + 1) + 𝐾)
26	24, 25	eqtr4i 2213	. . . . . 6 ⊢ (2 + 𝐾) = ((1 + 𝐾) + 1)
27	22, 26	eqtr4i 2213	. . . . 5 ⊢ 𝑁 = (2 + 𝐾)
28	27	oveq1i 5910	. . . 4 ⊢ (𝑁 + 1) = ((2 + 𝐾) + 1)
29		2cn 9025	. . . . 5 ⊢ 2 ∈ ℂ
30	29, 17, 18	addassi 8000	. . . 4 ⊢ ((2 + 𝐾) + 1) = (2 + (𝐾 + 1))
31	28, 30	eqtri 2210	. . 3 ⊢ (𝑁 + 1) = (2 + (𝐾 + 1))
32	15, 31	breqtrri 4048	. 2 ⊢ 2 ∥ (𝑁 + 1)
33		elfzuz2 10065	. . . . 5 ⊢ ((𝐴 mod 8) ∈ (0...𝑁) → 𝑁 ∈ (ℤ_≥‘0))
34		fzm1 10136	. . . . 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 10065	. . . . . . . 8 ⊢ ((𝐴 mod 8) ∈ (0...𝑀) → 𝑀 ∈ (ℤ_≥‘0))
38		fzm1 10136	. . . . . . . 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 9293	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
42	7, 41	ax-mp 5	. . . . . . . 8 ⊢ 𝑀 ∈ ℂ
43	42, 18, 1	mvrraddi 8209	. . . . . . 7 ⊢ (𝑁 − 1) = 𝑀
44	43	oveq2i 5911	. . . . . 6 ⊢ (0...(𝑁 − 1)) = (0...𝑀)
45	40, 44	eleq2s 2284	. . . . 5 ⊢ ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) → ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀))
46	17, 18, 2	mvrraddi 8209	. . . . . . . . 9 ⊢ (𝑀 − 1) = 𝐾
47	46	oveq2i 5911	. . . . . . . 8 ⊢ (0...(𝑀 − 1)) = (0...𝐾)
48	47	eleq2i 2256	. . . . . . 7 ⊢ ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ↔ (𝐴 mod 8) ∈ (0...𝐾))
49	3	simp3i 1010	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...𝐾) → (𝐴 mod 8) ∈ 𝑆))
50	48, 49	biimtrid 152	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) → (𝐴 mod 8) ∈ 𝑆))
51		2nn 9115	. . . . . . . . . . 11 ⊢ 2 ∈ ℕ
52		8nn 9121	. . . . . . . . . . 11 ⊢ 8 ∈ ℕ
53		4z 9318	. . . . . . . . . . . . . 14 ⊢ 4 ∈ ℤ
54		dvdsmul2 11862	. . . . . . . . . . . . . 14 ⊢ ((4 ∈ ℤ ∧ 2 ∈ ℤ) → 2 ∥ (4 · 2))
55	53, 12, 54	mp2an 426	. . . . . . . . . . . . 13 ⊢ 2 ∥ (4 · 2)
56		4t2e8 9112	. . . . . . . . . . . . 13 ⊢ (4 · 2) = 8
57	55, 56	breqtri 4046	. . . . . . . . . . . 12 ⊢ 2 ∥ 8
58		dvdsmod 11909	. . . . . . . . . . . 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 1338	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℤ → (2 ∥ (𝐴 mod 8) ↔ 2 ∥ 𝐴))
61	60	notbid 668	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → (¬ 2 ∥ (𝐴 mod 8) ↔ ¬ 2 ∥ 𝐴))
62	61	biimpar 297	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ¬ 2 ∥ (𝐴 mod 8))
63	11, 2	breqtrri 4048	. . . . . . . . 9 ⊢ 2 ∥ 𝑀
64		id 19	. . . . . . . . 9 ⊢ ((𝐴 mod 8) = 𝑀 → (𝐴 mod 8) = 𝑀)
65	63, 64	breqtrrid 4059	. . . . . . . 8 ⊢ ((𝐴 mod 8) = 𝑀 → 2 ∥ (𝐴 mod 8))
66	62, 65	nsyl 629	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ¬ (𝐴 mod 8) = 𝑀)
67	66	pm2.21d 620	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ¬ 2 ∥ 𝐴) → ((𝐴 mod 8) = 𝑀 → (𝐴 mod 8) ∈ 𝑆))
68	50, 67	jaod 718	. . . . 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 2252	. . . . . 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 718	. . 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 1177	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 709 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 class class class wbr 4021 ‘cfv 5238 (class class class)co 5900 ℂcc 7844 0cc0 7846 1c1 7847 + caddc 7849 · cmul 7851 − cmin 8163 ℕcn 8954 2c2 9005 4c4 9007 8c8 9011 ℤcz 9288 ℤ_≥cuz 9563 ...cfz 10044 mod cmo 10359 ∥ cdvds 11835

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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-sep 4139 ax-pow 4195 ax-pr 4230 ax-un 4454 ax-setind 4557 ax-cnex 7937 ax-resscn 7938 ax-1cn 7939 ax-1re 7940 ax-icn 7941 ax-addcl 7942 ax-addrcl 7943 ax-mulcl 7944 ax-mulrcl 7945 ax-addcom 7946 ax-mulcom 7947 ax-addass 7948 ax-mulass 7949 ax-distr 7950 ax-i2m1 7951 ax-0lt1 7952 ax-1rid 7953 ax-0id 7954 ax-rnegex 7955 ax-precex 7956 ax-cnre 7957 ax-pre-ltirr 7958 ax-pre-ltwlin 7959 ax-pre-lttrn 7960 ax-pre-apti 7961 ax-pre-ltadd 7962 ax-pre-mulgt0 7963 ax-pre-mulext 7964 ax-arch 7965

This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3595 df-sn 3616 df-pr 3617 df-op 3619 df-uni 3828 df-int 3863 df-iun 3906 df-br 4022 df-opab 4083 df-mpt 4084 df-id 4314 df-po 4317 df-iso 4318 df-xp 4653 df-rel 4654 df-cnv 4655 df-co 4656 df-dm 4657 df-rn 4658 df-res 4659 df-ima 4660 df-iota 5199 df-fun 5240 df-fn 5241 df-f 5242 df-fv 5246 df-riota 5855 df-ov 5903 df-oprab 5904 df-mpo 5905 df-1st 6169 df-2nd 6170 df-pnf 8029 df-mnf 8030 df-xr 8031 df-ltxr 8032 df-le 8033 df-sub 8165 df-neg 8166 df-reap 8567 df-ap 8574 df-div 8665 df-inn 8955 df-2 9013 df-3 9014 df-4 9015 df-5 9016 df-6 9017 df-7 9018 df-8 9019 df-n0 9212 df-z 9289 df-uz 9564 df-q 9656 df-rp 9690 df-fz 10045 df-fl 10307 df-mod 10360 df-dvds 11836

This theorem is referenced by: lgsdir2lem3 14917

W3C validator