lgsdir2lem2 - Intuitionistic Logic Explorer

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

Theorem lgsdir2lem2 15145

Description: Lemma for lgsdir2 15149. (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 9353	. . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 + 1) ∈ ℤ)
6	4, 5	ax-mp 5	. . . . 5 ⊢ (𝐾 + 1) ∈ ℤ
7	2, 6	eqeltri 2266	. . . 4 ⊢ 𝑀 ∈ ℤ
8		peano2z 9353	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝑀 + 1) ∈ ℤ)
9	7, 8	ax-mp 5	. . 3 ⊢ (𝑀 + 1) ∈ ℤ
10	1, 9	eqeltri 2266	. 2 ⊢ 𝑁 ∈ ℤ
11	3	simp2i 1009	. . . 4 ⊢ 2 ∥ (𝐾 + 1)
12		2z 9345	. . . . 5 ⊢ 2 ∈ ℤ
13		dvdsadd 11979	. . . . 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 9322	. . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ)
17	4, 16	ax-mp 5	. . . . . . . . . 10 ⊢ 𝐾 ∈ ℂ
18		ax-1cn 7965	. . . . . . . . . 10 ⊢ 1 ∈ ℂ
19	17, 18	addcomi 8163	. . . . . . . . 9 ⊢ (𝐾 + 1) = (1 + 𝐾)
20	2, 19	eqtri 2214	. . . . . . . 8 ⊢ 𝑀 = (1 + 𝐾)
21	20	oveq1i 5928	. . . . . . 7 ⊢ (𝑀 + 1) = ((1 + 𝐾) + 1)
22	1, 21	eqtri 2214	. . . . . 6 ⊢ 𝑁 = ((1 + 𝐾) + 1)
23		df-2 9041	. . . . . . . 8 ⊢ 2 = (1 + 1)
24	23	oveq1i 5928	. . . . . . 7 ⊢ (2 + 𝐾) = ((1 + 1) + 𝐾)
25	18, 17, 18	add32i 8183	. . . . . . 7 ⊢ ((1 + 𝐾) + 1) = ((1 + 1) + 𝐾)
26	24, 25	eqtr4i 2217	. . . . . 6 ⊢ (2 + 𝐾) = ((1 + 𝐾) + 1)
27	22, 26	eqtr4i 2217	. . . . 5 ⊢ 𝑁 = (2 + 𝐾)
28	27	oveq1i 5928	. . . 4 ⊢ (𝑁 + 1) = ((2 + 𝐾) + 1)
29		2cn 9053	. . . . 5 ⊢ 2 ∈ ℂ
30	29, 17, 18	addassi 8027	. . . 4 ⊢ ((2 + 𝐾) + 1) = (2 + (𝐾 + 1))
31	28, 30	eqtri 2214	. . 3 ⊢ (𝑁 + 1) = (2 + (𝐾 + 1))
32	15, 31	breqtrri 4056	. 2 ⊢ 2 ∥ (𝑁 + 1)
33		elfzuz2 10095	. . . . 5 ⊢ ((𝐴 mod 8) ∈ (0...𝑁) → 𝑁 ∈ (ℤ_≥‘0))
34		fzm1 10166	. . . . 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 10095	. . . . . . . 8 ⊢ ((𝐴 mod 8) ∈ (0...𝑀) → 𝑀 ∈ (ℤ_≥‘0))
38		fzm1 10166	. . . . . . . 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 9322	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
42	7, 41	ax-mp 5	. . . . . . . 8 ⊢ 𝑀 ∈ ℂ
43	42, 18, 1	mvrraddi 8236	. . . . . . 7 ⊢ (𝑁 − 1) = 𝑀
44	43	oveq2i 5929	. . . . . 6 ⊢ (0...(𝑁 − 1)) = (0...𝑀)
45	40, 44	eleq2s 2288	. . . . 5 ⊢ ((𝐴 mod 8) ∈ (0...(𝑁 − 1)) → ((𝐴 mod 8) ∈ (0...(𝑀 − 1)) ∨ (𝐴 mod 8) = 𝑀))
46	17, 18, 2	mvrraddi 8236	. . . . . . . . 9 ⊢ (𝑀 − 1) = 𝐾
47	46	oveq2i 5929	. . . . . . . 8 ⊢ (0...(𝑀 − 1)) = (0...𝐾)
48	47	eleq2i 2260	. . . . . . 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 9143	. . . . . . . . . . 11 ⊢ 2 ∈ ℕ
52		8nn 9149	. . . . . . . . . . 11 ⊢ 8 ∈ ℕ
53		4z 9347	. . . . . . . . . . . . . 14 ⊢ 4 ∈ ℤ
54		dvdsmul2 11957	. . . . . . . . . . . . . 14 ⊢ ((4 ∈ ℤ ∧ 2 ∈ ℤ) → 2 ∥ (4 · 2))
55	53, 12, 54	mp2an 426	. . . . . . . . . . . . 13 ⊢ 2 ∥ (4 · 2)
56		4t2e8 9140	. . . . . . . . . . . . 13 ⊢ (4 · 2) = 8
57	55, 56	breqtri 4054	. . . . . . . . . . . 12 ⊢ 2 ∥ 8
58		dvdsmod 12004	. . . . . . . . . . . 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 4056	. . . . . . . . 9 ⊢ 2 ∥ 𝑀
64		id 19	. . . . . . . . 9 ⊢ ((𝐴 mod 8) = 𝑀 → (𝐴 mod 8) = 𝑀)
65	63, 64	breqtrrid 4067	. . . . . . . 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 2256	. . . . . 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 2164 class class class wbr 4029 ‘cfv 5254 (class class class)co 5918 ℂcc 7870 0cc0 7872 1c1 7873 + caddc 7875 · cmul 7877 − cmin 8190 ℕcn 8982 2c2 9033 4c4 9035 8c8 9039 ℤcz 9317 ℤ_≥cuz 9592 ...cfz 10074 mod cmo 10393 ∥ cdvds 11930

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 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 ax-arch 7991

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 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-po 4327 df-iso 4328 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 df-2 9041 df-3 9042 df-4 9043 df-5 9044 df-6 9045 df-7 9046 df-8 9047 df-n0 9241 df-z 9318 df-uz 9593 df-q 9685 df-rp 9720 df-fz 10075 df-fl 10339 df-mod 10394 df-dvds 11931

This theorem is referenced by: lgsdir2lem3 15146

W3C validator