lgsquadlemsfi - Intuitionistic Logic Explorer

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

Theorem lgsquadlemsfi 15940

Description: Lemma for lgsquad 15945. 𝑆 is finite. (Contributed by Jim Kingdon, 16-Sep-2025.)

**Hypotheses**
Ref	Expression
lgseisen.1	⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
lgseisen.2	⊢ (𝜑 → 𝑄 ∈ (ℙ ∖ {2}))
lgseisen.3	⊢ (𝜑 → 𝑃 ≠ 𝑄)
lgsquad.4	⊢ 𝑀 = ((𝑃 − 1) / 2)
lgsquad.5	⊢ 𝑁 = ((𝑄 − 1) / 2)
lgsquad.6	⊢ 𝑆 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁)) ∧ (𝑦 · 𝑃) < (𝑥 · 𝑄))}

**Assertion**
Ref	Expression
lgsquadlemsfi	⊢ (𝜑 → 𝑆 ∈ Fin)

Distinct variable groups: 𝑥,𝑦,𝑃 𝜑,𝑥,𝑦 𝑦,𝑀 𝑥,𝑁,𝑦 𝑥,𝑄,𝑦 𝑥,𝑆 𝑥,𝑀 𝑦,𝑆

**Proof of Theorem lgsquadlemsfi**
Step	Hyp	Ref	Expression
1		lgsquad.6	. 2 ⊢ 𝑆 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁)) ∧ (𝑦 · 𝑃) < (𝑥 · 𝑄))}
2		1zzd 9603	. . 3 ⊢ (𝜑 → 1 ∈ ℤ)
3		lgseisen.1	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
4		lgsquad.4	. . . . 5 ⊢ 𝑀 = ((𝑃 − 1) / 2)
5	3, 4	gausslemma2dlem0b 15915	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
6	5	nnzd 9698	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
7	2, 6	fzfigd 10792	. 2 ⊢ (𝜑 → (1...𝑀) ∈ Fin)
8		lgseisen.2	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ (ℙ ∖ {2}))
9		lgsquad.5	. . . . 5 ⊢ 𝑁 = ((𝑄 − 1) / 2)
10	8, 9	gausslemma2dlem0b 15915	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ)
11	10	nnzd 9698	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
12	2, 11	fzfigd 10792	. 2 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
13		elfznn 10387	. . . . . . 7 ⊢ (𝑦 ∈ (1...𝑁) → 𝑦 ∈ ℕ)
14	13	ad2antll 491	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → 𝑦 ∈ ℕ)
15	3	gausslemma2dlem0a 15914	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ ℕ)
16	15	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → 𝑃 ∈ ℕ)
17	14, 16	nnmulcld 9285	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → (𝑦 · 𝑃) ∈ ℕ)
18	17	nnzd 9698	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → (𝑦 · 𝑃) ∈ ℤ)
19		elfznn 10387	. . . . . . 7 ⊢ (𝑥 ∈ (1...𝑀) → 𝑥 ∈ ℕ)
20	19	ad2antrl 490	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → 𝑥 ∈ ℕ)
21	8	gausslemma2dlem0a 15914	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ ℕ)
22	21	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → 𝑄 ∈ ℕ)
23	20, 22	nnmulcld 9285	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → (𝑥 · 𝑄) ∈ ℕ)
24	23	nnzd 9698	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → (𝑥 · 𝑄) ∈ ℤ)
25		zdclt 9654	. . . 4 ⊢ (((𝑦 · 𝑃) ∈ ℤ ∧ (𝑥 · 𝑄) ∈ ℤ) → DECID (𝑦 · 𝑃) < (𝑥 · 𝑄))
26	18, 24, 25	syl2anc 411	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...𝑀) ∧ 𝑦 ∈ (1...𝑁))) → DECID (𝑦 · 𝑃) < (𝑥 · 𝑄))
27	26	ralrimivva 2624	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (1...𝑀)∀𝑦 ∈ (1...𝑁)DECID (𝑦 · 𝑃) < (𝑥 · 𝑄))
28	1, 7, 12, 27	opabfi 7199	1 ⊢ (𝜑 → 𝑆 ∈ Fin)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 DECID wdc 842 = wceq 1398 ∈ wcel 2203 ≠ wne 2412 ∖ cdif 3207 {csn 3688 class class class wbr 4108 {copab 4169 (class class class)co 6049 Fincfn 6974 1c1 8127 · cmul 8131 < clt 8307 − cmin 8443 / cdiv 8945 ℕcn 9236 2c2 9287 ℤcz 9576 ...cfz 10341 ℙcprime 12800

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 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-mulrcl 8225 ax-addcom 8226 ax-mulcom 8227 ax-addass 8228 ax-mulass 8229 ax-distr 8230 ax-i2m1 8231 ax-0lt1 8232 ax-1rid 8233 ax-0id 8234 ax-rnegex 8235 ax-precex 8236 ax-cnre 8237 ax-pre-ltirr 8238 ax-pre-ltwlin 8239 ax-pre-lttrn 8240 ax-pre-apti 8241 ax-pre-ltadd 8242 ax-pre-mulgt0 8243 ax-pre-mulext 8244 ax-arch 8245 ax-caucvg 8246

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-xor 1421 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-po 4416 df-iso 4417 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-1o 6646 df-2o 6647 df-er 6766 df-en 6975 df-fin 6977 df-pnf 8309 df-mnf 8310 df-xr 8311 df-ltxr 8312 df-le 8313 df-sub 8445 df-neg 8446 df-reap 8848 df-ap 8855 df-div 8946 df-inn 9237 df-2 9295 df-3 9296 df-4 9297 df-n0 9496 df-z 9577 df-uz 9853 df-q 9951 df-rp 9986 df-fz 10342 df-seqfrec 10809 df-exp 10900 df-cj 11523 df-re 11524 df-im 11525 df-rsqrt 11679 df-abs 11680 df-dvds 12470 df-prm 12801

This theorem is referenced by: lgsquadlemofi 15941 lgsquadlem1 15942 lgsquadlem2 15943 lgsquadlem3 15944

W3C validator