2lgslem1 - Intuitionistic Logic Explorer

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

Theorem 2lgslem1 15332

Description: Lemma 1 for 2lgs 15345. (Contributed by AV, 19-Jun-2021.)

**Assertion**
Ref	Expression
2lgslem1	⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))}) = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))))

Distinct variable group: 𝑃,𝑖,𝑥

Proof of Theorem 2lgslem1 Dummy variables 𝑓 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		2lgslem1a 15329	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → {𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))} = {𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)})
2	1	fveq2d 5562	. 2 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))}) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}))
3		prmz 12279	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
4		4nn 9154	. . . . . . . 8 ⊢ 4 ∈ ℕ
5		znq 9698	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ 4 ∈ ℕ) → (𝑃 / 4) ∈ ℚ)
6	3, 4, 5	sylancl 413	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → (𝑃 / 4) ∈ ℚ)
7	6	adantr 276	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (𝑃 / 4) ∈ ℚ)
8	7	flqcld 10367	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (⌊‘(𝑃 / 4)) ∈ ℤ)
9	8	peano2zd 9451	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((⌊‘(𝑃 / 4)) + 1) ∈ ℤ)
10		nnoddn2prmb 12431	. . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) ↔ (𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃))
11		oddprm 12428	. . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ)
12	10, 11	sylbir 135	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((𝑃 − 1) / 2) ∈ ℕ)
13	12	nnzd 9447	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((𝑃 − 1) / 2) ∈ ℤ)
14	9, 13	fzfigd 10523	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ∈ Fin)
15	14	mptexd 5789	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)) ∈ V)
16		eqid 2196	. . . . 5 ⊢ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) = (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))
17		eqid 2196	. . . . 5 ⊢ (𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)) = (𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2))
18	16, 17	2lgslem1b 15330	. . . 4 ⊢ (𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)):(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}
19		f1oeq1 5492	. . . . 5 ⊢ (𝑓 = (𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)) → (𝑓:(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)} ↔ (𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)):(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}))
20	19	spcegv 2852	. . . 4 ⊢ ((𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)) ∈ V → ((𝑦 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ↦ (𝑦 · 2)):(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)} → ∃𝑓 𝑓:(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}))
21	15, 18, 20	mpisyl 1457	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ∃𝑓 𝑓:(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)})
22		fihasheqf1oi 10879	. . . . 5 ⊢ (((((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ∈ Fin ∧ 𝑓:(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}) → (♯‘(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}))
23	22	ex 115	. . . 4 ⊢ ((((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ∈ Fin → (𝑓:(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)} → (♯‘(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)})))
24	23	exlimdv 1833	. . 3 ⊢ ((((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2)) ∈ Fin → (∃𝑓 𝑓:(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))–1-1-onto→{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)} → (♯‘(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)})))
25	14, 21, 24	sylc 62	. 2 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (♯‘(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))) = (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))𝑥 = (𝑖 · 2)}))
26	6	flqcld 10367	. . . . 5 ⊢ (𝑃 ∈ ℙ → (⌊‘(𝑃 / 4)) ∈ ℤ)
27	26	adantr 276	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (⌊‘(𝑃 / 4)) ∈ ℤ)
28		oddm1d2 12057	. . . . . 6 ⊢ (𝑃 ∈ ℤ → (¬ 2 ∥ 𝑃 ↔ ((𝑃 − 1) / 2) ∈ ℤ))
29	3, 28	syl 14	. . . . 5 ⊢ (𝑃 ∈ ℙ → (¬ 2 ∥ 𝑃 ↔ ((𝑃 − 1) / 2) ∈ ℤ))
30	29	biimpa 296	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((𝑃 − 1) / 2) ∈ ℤ)
31		2lgslem1c 15331	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2))
32		eluz2 9607	. . . 4 ⊢ (((𝑃 − 1) / 2) ∈ (ℤ_≥‘(⌊‘(𝑃 / 4))) ↔ ((⌊‘(𝑃 / 4)) ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℤ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2)))
33	27, 30, 31, 32	syl3anbrc 1183	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → ((𝑃 − 1) / 2) ∈ (ℤ_≥‘(⌊‘(𝑃 / 4))))
34		hashfzp1 10916	. . 3 ⊢ (((𝑃 − 1) / 2) ∈ (ℤ_≥‘(⌊‘(𝑃 / 4))) → (♯‘(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))) = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))))
35	33, 34	syl 14	. 2 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (♯‘(((⌊‘(𝑃 / 4)) + 1)...((𝑃 − 1) / 2))) = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))))
36	2, 25, 35	3eqtr2d 2235	1 ⊢ ((𝑃 ∈ ℙ ∧ ¬ 2 ∥ 𝑃) → (♯‘{𝑥 ∈ ℤ ∣ ∃𝑖 ∈ (1...((𝑃 − 1) / 2))(𝑥 = (𝑖 · 2) ∧ (𝑃 / 2) < (𝑥 mod 𝑃))}) = (((𝑃 − 1) / 2) − (⌊‘(𝑃 / 4))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∃wex 1506 ∈ wcel 2167 ∃wrex 2476 {crab 2479 Vcvv 2763 ∖ cdif 3154 {csn 3622 class class class wbr 4033 ↦ cmpt 4094 –1-1-onto→wf1o 5257 ‘cfv 5258 (class class class)co 5922 Fincfn 6799 1c1 7880 + caddc 7882 · cmul 7884 < clt 8061 ≤ cle 8062 − cmin 8197 / cdiv 8699 ℕcn 8990 2c2 9041 4c4 9043 ℤcz 9326 ℤ_≥cuz 9601 ℚcq 9693 ...cfz 10083 ⌊cfl 10358 mod cmo 10414 ♯chash 10867 ∥ cdvds 11952 ℙcprime 12275

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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4148 ax-sep 4151 ax-nul 4159 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-iinf 4624 ax-cnex 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-mulrcl 7978 ax-addcom 7979 ax-mulcom 7980 ax-addass 7981 ax-mulass 7982 ax-distr 7983 ax-i2m1 7984 ax-0lt1 7985 ax-1rid 7986 ax-0id 7987 ax-rnegex 7988 ax-precex 7989 ax-cnre 7990 ax-pre-ltirr 7991 ax-pre-ltwlin 7992 ax-pre-lttrn 7993 ax-pre-apti 7994 ax-pre-ltadd 7995 ax-pre-mulgt0 7996 ax-pre-mulext 7997 ax-arch 7998 ax-caucvg 7999

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-xor 1387 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-if 3562 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-br 4034 df-opab 4095 df-mpt 4096 df-tr 4132 df-id 4328 df-po 4331 df-iso 4332 df-iord 4401 df-on 4403 df-ilim 4404 df-suc 4406 df-iom 4627 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-f1 5263 df-fo 5264 df-f1o 5265 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-1st 6198 df-2nd 6199 df-recs 6363 df-frec 6449 df-1o 6474 df-2o 6475 df-er 6592 df-en 6800 df-dom 6801 df-fin 6802 df-pnf 8063 df-mnf 8064 df-xr 8065 df-ltxr 8066 df-le 8067 df-sub 8199 df-neg 8200 df-reap 8602 df-ap 8609 df-div 8700 df-inn 8991 df-2 9049 df-3 9050 df-4 9051 df-n0 9250 df-z 9327 df-uz 9602 df-q 9694 df-rp 9729 df-fz 10084 df-fl 10360 df-mod 10415 df-seqfrec 10540 df-exp 10631 df-ihash 10868 df-cj 11007 df-re 11008 df-im 11009 df-rsqrt 11163 df-abs 11164 df-dvds 11953 df-prm 12276

This theorem is referenced by: 2lgs 15345

W3C validator