perfectALTVlem1 - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > perfectALTVlem1		Structured version Visualization version GIF version

Theorem perfectALTVlem1 45903

Description: Lemma for perfectALTV 45905. (Contributed by Mario Carneiro, 7-Jun-2016.) (Revised by AV, 1-Jul-2020.)

**Hypotheses**
Ref	Expression
perfectALTVlem.1	⊢ (𝜑 → 𝐴 ∈ ℕ)
perfectALTVlem.2	⊢ (𝜑 → 𝐵 ∈ ℕ)
perfectALTVlem.3	⊢ (𝜑 → 𝐵 ∈ Odd )
perfectALTVlem.4	⊢ (𝜑 → (1 σ ((2↑𝐴) · 𝐵)) = (2 · ((2↑𝐴) · 𝐵)))

**Assertion**
Ref	Expression
perfectALTVlem1	⊢ (𝜑 → ((2↑(𝐴 + 1)) ∈ ℕ ∧ ((2↑(𝐴 + 1)) − 1) ∈ ℕ ∧ (𝐵 / ((2↑(𝐴 + 1)) − 1)) ∈ ℕ))

**Proof of Theorem perfectALTVlem1**
Step	Hyp	Ref	Expression
1		2nn 12226	. . 3 ⊢ 2 ∈ ℕ
2		perfectALTVlem.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℕ)
3	2	nnnn0d 12473	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℕ₀)
4		peano2nn0 12453	. . . 4 ⊢ (𝐴 ∈ ℕ₀ → (𝐴 + 1) ∈ ℕ₀)
5	3, 4	syl 17	. . 3 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ₀)
6		nnexpcl 13980	. . 3 ⊢ ((2 ∈ ℕ ∧ (𝐴 + 1) ∈ ℕ₀) → (2↑(𝐴 + 1)) ∈ ℕ)
7	1, 5, 6	sylancr 587	. 2 ⊢ (𝜑 → (2↑(𝐴 + 1)) ∈ ℕ)
8		2re 12227	. . . . 5 ⊢ 2 ∈ ℝ
9	8	a1i 11	. . . 4 ⊢ (𝜑 → 2 ∈ ℝ)
10	2	peano2nnd 12170	. . . 4 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ)
11		1lt2 12324	. . . . 5 ⊢ 1 < 2
12	11	a1i 11	. . . 4 ⊢ (𝜑 → 1 < 2)
13		expgt1 14006	. . . 4 ⊢ ((2 ∈ ℝ ∧ (𝐴 + 1) ∈ ℕ ∧ 1 < 2) → 1 < (2↑(𝐴 + 1)))
14	9, 10, 12, 13	syl3anc 1371	. . 3 ⊢ (𝜑 → 1 < (2↑(𝐴 + 1)))
15		1nn 12164	. . . 4 ⊢ 1 ∈ ℕ
16		nnsub 12197	. . . 4 ⊢ ((1 ∈ ℕ ∧ (2↑(𝐴 + 1)) ∈ ℕ) → (1 < (2↑(𝐴 + 1)) ↔ ((2↑(𝐴 + 1)) − 1) ∈ ℕ))
17	15, 7, 16	sylancr 587	. . 3 ⊢ (𝜑 → (1 < (2↑(𝐴 + 1)) ↔ ((2↑(𝐴 + 1)) − 1) ∈ ℕ))
18	14, 17	mpbid 231	. 2 ⊢ (𝜑 → ((2↑(𝐴 + 1)) − 1) ∈ ℕ)
19	7	nnzd 12526	. . . . . . 7 ⊢ (𝜑 → (2↑(𝐴 + 1)) ∈ ℤ)
20		peano2zm 12546	. . . . . . 7 ⊢ ((2↑(𝐴 + 1)) ∈ ℤ → ((2↑(𝐴 + 1)) − 1) ∈ ℤ)
21	19, 20	syl 17	. . . . . 6 ⊢ (𝜑 → ((2↑(𝐴 + 1)) − 1) ∈ ℤ)
22		1nn0 12429	. . . . . . . 8 ⊢ 1 ∈ ℕ₀
23		perfectALTVlem.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℕ)
24		sgmnncl 26496	. . . . . . . 8 ⊢ ((1 ∈ ℕ₀ ∧ 𝐵 ∈ ℕ) → (1 σ 𝐵) ∈ ℕ)
25	22, 23, 24	sylancr 587	. . . . . . 7 ⊢ (𝜑 → (1 σ 𝐵) ∈ ℕ)
26	25	nnzd 12526	. . . . . 6 ⊢ (𝜑 → (1 σ 𝐵) ∈ ℤ)
27		dvdsmul1 16160	. . . . . 6 ⊢ ((((2↑(𝐴 + 1)) − 1) ∈ ℤ ∧ (1 σ 𝐵) ∈ ℤ) → ((2↑(𝐴 + 1)) − 1) ∥ (((2↑(𝐴 + 1)) − 1) · (1 σ 𝐵)))
28	21, 26, 27	syl2anc 584	. . . . 5 ⊢ (𝜑 → ((2↑(𝐴 + 1)) − 1) ∥ (((2↑(𝐴 + 1)) − 1) · (1 σ 𝐵)))
29		2cn 12228	. . . . . . . . 9 ⊢ 2 ∈ ℂ
30		expp1 13974	. . . . . . . . 9 ⊢ ((2 ∈ ℂ ∧ 𝐴 ∈ ℕ₀) → (2↑(𝐴 + 1)) = ((2↑𝐴) · 2))
31	29, 3, 30	sylancr 587	. . . . . . . 8 ⊢ (𝜑 → (2↑(𝐴 + 1)) = ((2↑𝐴) · 2))
32		nnexpcl 13980	. . . . . . . . . . 11 ⊢ ((2 ∈ ℕ ∧ 𝐴 ∈ ℕ₀) → (2↑𝐴) ∈ ℕ)
33	1, 3, 32	sylancr 587	. . . . . . . . . 10 ⊢ (𝜑 → (2↑𝐴) ∈ ℕ)
34	33	nncnd 12169	. . . . . . . . 9 ⊢ (𝜑 → (2↑𝐴) ∈ ℂ)
35		mulcom 11137	. . . . . . . . 9 ⊢ (((2↑𝐴) ∈ ℂ ∧ 2 ∈ ℂ) → ((2↑𝐴) · 2) = (2 · (2↑𝐴)))
36	34, 29, 35	sylancl 586	. . . . . . . 8 ⊢ (𝜑 → ((2↑𝐴) · 2) = (2 · (2↑𝐴)))
37	31, 36	eqtrd 2776	. . . . . . 7 ⊢ (𝜑 → (2↑(𝐴 + 1)) = (2 · (2↑𝐴)))
38	37	oveq1d 7372	. . . . . 6 ⊢ (𝜑 → ((2↑(𝐴 + 1)) · 𝐵) = ((2 · (2↑𝐴)) · 𝐵))
39	29	a1i 11	. . . . . . 7 ⊢ (𝜑 → 2 ∈ ℂ)
40	23	nncnd 12169	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
41	39, 34, 40	mulassd 11178	. . . . . 6 ⊢ (𝜑 → ((2 · (2↑𝐴)) · 𝐵) = (2 · ((2↑𝐴) · 𝐵)))
42		1cnd 11150	. . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℂ)
43		perfectALTVlem.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ Odd )
44		isodd7 45847	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Odd ↔ (𝐵 ∈ ℤ ∧ (2 gcd 𝐵) = 1))
45	44	simprbi 497	. . . . . . . . . 10 ⊢ (𝐵 ∈ Odd → (2 gcd 𝐵) = 1)
46	43, 45	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (2 gcd 𝐵) = 1)
47		2z 12535	. . . . . . . . . . 11 ⊢ 2 ∈ ℤ
48	47	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℤ)
49	23	nnzd 12526	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℤ)
50		rpexp1i 16599	. . . . . . . . . 10 ⊢ ((2 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐴 ∈ ℕ₀) → ((2 gcd 𝐵) = 1 → ((2↑𝐴) gcd 𝐵) = 1))
51	48, 49, 3, 50	syl3anc 1371	. . . . . . . . 9 ⊢ (𝜑 → ((2 gcd 𝐵) = 1 → ((2↑𝐴) gcd 𝐵) = 1))
52	46, 51	mpd 15	. . . . . . . 8 ⊢ (𝜑 → ((2↑𝐴) gcd 𝐵) = 1)
53		sgmmul 26549	. . . . . . . 8 ⊢ ((1 ∈ ℂ ∧ ((2↑𝐴) ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ ((2↑𝐴) gcd 𝐵) = 1)) → (1 σ ((2↑𝐴) · 𝐵)) = ((1 σ (2↑𝐴)) · (1 σ 𝐵)))
54	42, 33, 23, 52, 53	syl13anc 1372	. . . . . . 7 ⊢ (𝜑 → (1 σ ((2↑𝐴) · 𝐵)) = ((1 σ (2↑𝐴)) · (1 σ 𝐵)))
55		perfectALTVlem.4	. . . . . . 7 ⊢ (𝜑 → (1 σ ((2↑𝐴) · 𝐵)) = (2 · ((2↑𝐴) · 𝐵)))
56	2	nncnd 12169	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℂ)
57		pncan1 11579	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℂ → ((𝐴 + 1) − 1) = 𝐴)
58	56, 57	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴 + 1) − 1) = 𝐴)
59	58	oveq2d 7373	. . . . . . . . . 10 ⊢ (𝜑 → (2↑((𝐴 + 1) − 1)) = (2↑𝐴))
60	59	oveq2d 7373	. . . . . . . . 9 ⊢ (𝜑 → (1 σ (2↑((𝐴 + 1) − 1))) = (1 σ (2↑𝐴)))
61		1sgm2ppw 26548	. . . . . . . . . 10 ⊢ ((𝐴 + 1) ∈ ℕ → (1 σ (2↑((𝐴 + 1) − 1))) = ((2↑(𝐴 + 1)) − 1))
62	10, 61	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (1 σ (2↑((𝐴 + 1) − 1))) = ((2↑(𝐴 + 1)) − 1))
63	60, 62	eqtr3d 2778	. . . . . . . 8 ⊢ (𝜑 → (1 σ (2↑𝐴)) = ((2↑(𝐴 + 1)) − 1))
64	63	oveq1d 7372	. . . . . . 7 ⊢ (𝜑 → ((1 σ (2↑𝐴)) · (1 σ 𝐵)) = (((2↑(𝐴 + 1)) − 1) · (1 σ 𝐵)))
65	54, 55, 64	3eqtr3d 2784	. . . . . 6 ⊢ (𝜑 → (2 · ((2↑𝐴) · 𝐵)) = (((2↑(𝐴 + 1)) − 1) · (1 σ 𝐵)))
66	38, 41, 65	3eqtrd 2780	. . . . 5 ⊢ (𝜑 → ((2↑(𝐴 + 1)) · 𝐵) = (((2↑(𝐴 + 1)) − 1) · (1 σ 𝐵)))
67	28, 66	breqtrrd 5133	. . . 4 ⊢ (𝜑 → ((2↑(𝐴 + 1)) − 1) ∥ ((2↑(𝐴 + 1)) · 𝐵))
68	21, 19	gcdcomd 16394	. . . . 5 ⊢ (𝜑 → (((2↑(𝐴 + 1)) − 1) gcd (2↑(𝐴 + 1))) = ((2↑(𝐴 + 1)) gcd ((2↑(𝐴 + 1)) − 1)))
69		nnpw2evenALTV 45884	. . . . . . . . 9 ⊢ ((𝐴 + 1) ∈ ℕ → (2↑(𝐴 + 1)) ∈ Even )
70	10, 69	syl 17	. . . . . . . 8 ⊢ (𝜑 → (2↑(𝐴 + 1)) ∈ Even )
71		evenm1odd 45821	. . . . . . . 8 ⊢ ((2↑(𝐴 + 1)) ∈ Even → ((2↑(𝐴 + 1)) − 1) ∈ Odd )
72	70, 71	syl 17	. . . . . . 7 ⊢ (𝜑 → ((2↑(𝐴 + 1)) − 1) ∈ Odd )
73		isodd7 45847	. . . . . . . 8 ⊢ (((2↑(𝐴 + 1)) − 1) ∈ Odd ↔ (((2↑(𝐴 + 1)) − 1) ∈ ℤ ∧ (2 gcd ((2↑(𝐴 + 1)) − 1)) = 1))
74	73	simprbi 497	. . . . . . 7 ⊢ (((2↑(𝐴 + 1)) − 1) ∈ Odd → (2 gcd ((2↑(𝐴 + 1)) − 1)) = 1)
75	72, 74	syl 17	. . . . . 6 ⊢ (𝜑 → (2 gcd ((2↑(𝐴 + 1)) − 1)) = 1)
76		rpexp1i 16599	. . . . . . 7 ⊢ ((2 ∈ ℤ ∧ ((2↑(𝐴 + 1)) − 1) ∈ ℤ ∧ (𝐴 + 1) ∈ ℕ₀) → ((2 gcd ((2↑(𝐴 + 1)) − 1)) = 1 → ((2↑(𝐴 + 1)) gcd ((2↑(𝐴 + 1)) − 1)) = 1))
77	48, 21, 5, 76	syl3anc 1371	. . . . . 6 ⊢ (𝜑 → ((2 gcd ((2↑(𝐴 + 1)) − 1)) = 1 → ((2↑(𝐴 + 1)) gcd ((2↑(𝐴 + 1)) − 1)) = 1))
78	75, 77	mpd 15	. . . . 5 ⊢ (𝜑 → ((2↑(𝐴 + 1)) gcd ((2↑(𝐴 + 1)) − 1)) = 1)
79	68, 78	eqtrd 2776	. . . 4 ⊢ (𝜑 → (((2↑(𝐴 + 1)) − 1) gcd (2↑(𝐴 + 1))) = 1)
80		coprmdvds 16529	. . . . 5 ⊢ ((((2↑(𝐴 + 1)) − 1) ∈ ℤ ∧ (2↑(𝐴 + 1)) ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((((2↑(𝐴 + 1)) − 1) ∥ ((2↑(𝐴 + 1)) · 𝐵) ∧ (((2↑(𝐴 + 1)) − 1) gcd (2↑(𝐴 + 1))) = 1) → ((2↑(𝐴 + 1)) − 1) ∥ 𝐵))
81	21, 19, 49, 80	syl3anc 1371	. . . 4 ⊢ (𝜑 → ((((2↑(𝐴 + 1)) − 1) ∥ ((2↑(𝐴 + 1)) · 𝐵) ∧ (((2↑(𝐴 + 1)) − 1) gcd (2↑(𝐴 + 1))) = 1) → ((2↑(𝐴 + 1)) − 1) ∥ 𝐵))
82	67, 79, 81	mp2and 697	. . 3 ⊢ (𝜑 → ((2↑(𝐴 + 1)) − 1) ∥ 𝐵)
83		nndivdvds 16145	. . . 4 ⊢ ((𝐵 ∈ ℕ ∧ ((2↑(𝐴 + 1)) − 1) ∈ ℕ) → (((2↑(𝐴 + 1)) − 1) ∥ 𝐵 ↔ (𝐵 / ((2↑(𝐴 + 1)) − 1)) ∈ ℕ))
84	23, 18, 83	syl2anc 584	. . 3 ⊢ (𝜑 → (((2↑(𝐴 + 1)) − 1) ∥ 𝐵 ↔ (𝐵 / ((2↑(𝐴 + 1)) − 1)) ∈ ℕ))
85	82, 84	mpbid 231	. 2 ⊢ (𝜑 → (𝐵 / ((2↑(𝐴 + 1)) − 1)) ∈ ℕ)
86	7, 18, 85	3jca 1128	1 ⊢ (𝜑 → ((2↑(𝐴 + 1)) ∈ ℕ ∧ ((2↑(𝐴 + 1)) − 1) ∈ ℕ ∧ (𝐵 / ((2↑(𝐴 + 1)) − 1)) ∈ ℕ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5105 (class class class)co 7357 ℂcc 11049 ℝcr 11050 1c1 11052 + caddc 11054 · cmul 11056 < clt 11189 − cmin 11385 / cdiv 11812 ℕcn 12153 2c2 12208 ℕ₀cn0 12413 ℤcz 12499 ↑cexp 13967 ∥ cdvds 16136 gcd cgcd 16374 σ csgm 26445 Even ceven 45806 Odd codd 45807

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-inf2 9577 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 ax-pre-sup 11129 ax-addf 11130 ax-mulf 11131

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-tp 4591 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-iin 4957 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-se 5589 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-of 7617 df-om 7803 df-1st 7921 df-2nd 7922 df-supp 8093 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-1o 8412 df-2o 8413 df-er 8648 df-map 8767 df-pm 8768 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9306 df-fi 9347 df-sup 9378 df-inf 9379 df-oi 9446 df-card 9875 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-div 11813 df-nn 12154 df-2 12216 df-3 12217 df-4 12218 df-5 12219 df-6 12220 df-7 12221 df-8 12222 df-9 12223 df-n0 12414 df-z 12500 df-dec 12619 df-uz 12764 df-q 12874 df-rp 12916 df-xneg 13033 df-xadd 13034 df-xmul 13035 df-ioo 13268 df-ioc 13269 df-ico 13270 df-icc 13271 df-fz 13425 df-fzo 13568 df-fl 13697 df-mod 13775 df-seq 13907 df-exp 13968 df-fac 14174 df-bc 14203 df-hash 14231 df-shft 14952 df-cj 14984 df-re 14985 df-im 14986 df-sqrt 15120 df-abs 15121 df-limsup 15353 df-clim 15370 df-rlim 15371 df-sum 15571 df-ef 15950 df-sin 15952 df-cos 15953 df-pi 15955 df-dvds 16137 df-gcd 16375 df-prm 16548 df-pc 16709 df-struct 17019 df-sets 17036 df-slot 17054 df-ndx 17066 df-base 17084 df-ress 17113 df-plusg 17146 df-mulr 17147 df-starv 17148 df-sca 17149 df-vsca 17150 df-ip 17151 df-tset 17152 df-ple 17153 df-ds 17155 df-unif 17156 df-hom 17157 df-cco 17158 df-rest 17304 df-topn 17305 df-0g 17323 df-gsum 17324 df-topgen 17325 df-pt 17326 df-prds 17329 df-xrs 17384 df-qtop 17389 df-imas 17390 df-xps 17392 df-mre 17466 df-mrc 17467 df-acs 17469 df-mgm 18497 df-sgrp 18546 df-mnd 18557 df-submnd 18602 df-mulg 18873 df-cntz 19097 df-cmn 19564 df-psmet 20788 df-xmet 20789 df-met 20790 df-bl 20791 df-mopn 20792 df-fbas 20793 df-fg 20794 df-cnfld 20797 df-top 22243 df-topon 22260 df-topsp 22282 df-bases 22296 df-cld 22370 df-ntr 22371 df-cls 22372 df-nei 22449 df-lp 22487 df-perf 22488 df-cn 22578 df-cnp 22579 df-haus 22666 df-tx 22913 df-hmeo 23106 df-fil 23197 df-fm 23289 df-flim 23290 df-flf 23291 df-xms 23673 df-ms 23674 df-tms 23675 df-cncf 24241 df-limc 25230 df-dv 25231 df-log 25912 df-cxp 25913 df-sgm 26451 df-even 45808 df-odd 45809

This theorem is referenced by: perfectALTVlem2 45904

W3C validator