Theorem prmodvdslcmf 17009

Description: The primorial of a nonnegative integer divides the least common multiple of all positive integers less than or equal to the integer. (Contributed by AV, 19-Aug-2020.) (Revised by AV, 29-Aug-2020.)

Assertion

Ref	Expression
prmodvdslcmf	⊢ (𝑁 ∈ ℕ0 → (#p‘𝑁) ∥ (lcm‘(1...𝑁)))

Proof of Theorem prmodvdslcmf

Dummy variables 𝑘 𝑚 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prmoval 16995	. . 3 ⊢ (𝑁 ∈ ℕ0 → (#p‘𝑁) = ∏𝑘 ∈ (1...𝑁)if(𝑘 ∈ ℙ, 𝑘, 1))
2		eqidd 2740	. . . . . 6 ⊢ (𝑘 ∈ (1...𝑁) → (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)) = (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)))
3		simpr 485	. . . . . . . 8 ⊢ ((𝑘 ∈ (1...𝑁) ∧ 𝑚 = 𝑘) → 𝑚 = 𝑘)
4	3	eleq1d 2824	. . . . . . 7 ⊢ ((𝑘 ∈ (1...𝑁) ∧ 𝑚 = 𝑘) → (𝑚 ∈ ℙ ↔ 𝑘 ∈ ℙ))
5	4, 3	ifbieq1d 4479	. . . . . 6 ⊢ ((𝑘 ∈ (1...𝑁) ∧ 𝑚 = 𝑘) → if(𝑚 ∈ ℙ, 𝑚, 1) = if(𝑘 ∈ ℙ, 𝑘, 1))
6		elfznn 13498	. . . . . 6 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ)
7		1nn 12176	. . . . . . . 8 ⊢ 1 ∈ ℕ
8	7	a1i 11	. . . . . . 7 ⊢ (𝑘 ∈ (1...𝑁) → 1 ∈ ℕ)
9	6, 8	ifcld 4501	. . . . . 6 ⊢ (𝑘 ∈ (1...𝑁) → if(𝑘 ∈ ℙ, 𝑘, 1) ∈ ℕ)
10	2, 5, 6, 9	fvmptd 6943	. . . . 5 ⊢ (𝑘 ∈ (1...𝑁) → ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) = if(𝑘 ∈ ℙ, 𝑘, 1))
11	10	eqcomd 2745	. . . 4 ⊢ (𝑘 ∈ (1...𝑁) → if(𝑘 ∈ ℙ, 𝑘, 1) = ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘))
12	11	prodeq2i 15874	. . 3 ⊢ ∏𝑘 ∈ (1...𝑁)if(𝑘 ∈ ℙ, 𝑘, 1) = ∏𝑘 ∈ (1...𝑁)((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘)
13	1, 12	eqtrdi 2790	. 2 ⊢ (𝑁 ∈ ℕ0 → (#p‘𝑁) = ∏𝑘 ∈ (1...𝑁)((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘))
14		fzfid 13926	. . . 4 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ∈ Fin)
15		fz1ssnn 13500	. . . 4 ⊢ (1...𝑁) ⊆ ℕ
16	14, 15	jctil 524	. . 3 ⊢ (𝑁 ∈ ℕ0 → ((1...𝑁) ⊆ ℕ ∧ (1...𝑁) ∈ Fin))
17		fzssz 13471	. . . . 5 ⊢ (1...𝑁) ⊆ ℤ
18	17	a1i 11	. . . 4 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ⊆ ℤ)
19		0nelfz1 13488	. . . . 5 ⊢ 0 ∉ (1...𝑁)
20	19	a1i 11	. . . 4 ⊢ (𝑁 ∈ ℕ0 → 0 ∉ (1...𝑁))
21		lcmfn0cl 16586	. . . 4 ⊢ (((1...𝑁) ⊆ ℤ ∧ (1...𝑁) ∈ Fin ∧ 0 ∉ (1...𝑁)) → (lcm‘(1...𝑁)) ∈ ℕ)
22	18, 14, 20, 21	syl3anc 1379	. . 3 ⊢ (𝑁 ∈ ℕ0 → (lcm‘(1...𝑁)) ∈ ℕ)
23		id 22	. . . . . 6 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℕ)
24	7	a1i 11	. . . . . 6 ⊢ (𝑚 ∈ ℕ → 1 ∈ ℕ)
25	23, 24	ifcld 4501	. . . . 5 ⊢ (𝑚 ∈ ℕ → if(𝑚 ∈ ℙ, 𝑚, 1) ∈ ℕ)
26	25	adantl 482	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑚 ∈ ℕ) → if(𝑚 ∈ ℙ, 𝑚, 1) ∈ ℕ)
27	26	fmpttd 7056	. . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)):ℕ⟶ℕ)
28		simpr 485	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ (1...𝑁))
29	28	adantr 481	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑥 ∈ ((1...𝑁) ∖ {𝑘})) → 𝑘 ∈ (1...𝑁))
30		eldifi 4061	. . . . . . 7 ⊢ (𝑥 ∈ ((1...𝑁) ∖ {𝑘}) → 𝑥 ∈ (1...𝑁))
31	30	adantl 482	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑥 ∈ ((1...𝑁) ∖ {𝑘})) → 𝑥 ∈ (1...𝑁))
32		eldif 3893	. . . . . . . 8 ⊢ (𝑥 ∈ ((1...𝑁) ∖ {𝑘}) ↔ (𝑥 ∈ (1...𝑁) ∧ ¬ 𝑥 ∈ {𝑘}))
33		velsn 4571	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑘} ↔ 𝑥 = 𝑘)
34	33	biimpri 229	. . . . . . . . . 10 ⊢ (𝑥 = 𝑘 → 𝑥 ∈ {𝑘})
35	34	equcoms 2027	. . . . . . . . 9 ⊢ (𝑘 = 𝑥 → 𝑥 ∈ {𝑘})
36	35	necon3bi 2960	. . . . . . . 8 ⊢ (¬ 𝑥 ∈ {𝑘} → 𝑘 ≠ 𝑥)
37	32, 36	simplbiim 509	. . . . . . 7 ⊢ (𝑥 ∈ ((1...𝑁) ∖ {𝑘}) → 𝑘 ≠ 𝑥)
38	37	adantl 482	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑥 ∈ ((1...𝑁) ∖ {𝑘})) → 𝑘 ≠ 𝑥)
39		eqid 2739	. . . . . . 7 ⊢ (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)) = (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))
40	39	fvprmselgcd1 17007	. . . . . 6 ⊢ ((𝑘 ∈ (1...𝑁) ∧ 𝑥 ∈ (1...𝑁) ∧ 𝑘 ≠ 𝑥) → (((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) gcd ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑥)) = 1)
41	29, 31, 38, 40	syl3anc 1379	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑥 ∈ ((1...𝑁) ∖ {𝑘})) → (((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) gcd ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑥)) = 1)
42	41	ralrimiva 3131	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ∀𝑥 ∈ ((1...𝑁) ∖ {𝑘})(((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) gcd ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑥)) = 1)
43	42	ralrimiva 3131	. . 3 ⊢ (𝑁 ∈ ℕ0 → ∀𝑘 ∈ (1...𝑁)∀𝑥 ∈ ((1...𝑁) ∖ {𝑘})(((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) gcd ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑥)) = 1)
44		eqidd 2740	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)) = (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)))
45		simpr 485	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑚 = 𝑘) → 𝑚 = 𝑘)
46	45	eleq1d 2824	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑚 = 𝑘) → (𝑚 ∈ ℙ ↔ 𝑘 ∈ ℙ))
47	46, 45	ifbieq1d 4479	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) ∧ 𝑚 = 𝑘) → if(𝑚 ∈ ℙ, 𝑚, 1) = if(𝑘 ∈ ℙ, 𝑘, 1))
48	15, 28	sselid 3913	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ ℕ)
49	17, 28	sselid 3913	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ ℤ)
50		1zzd 12549	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 1 ∈ ℤ)
51	49, 50	ifcld 4501	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → if(𝑘 ∈ ℙ, 𝑘, 1) ∈ ℤ)
52	44, 47, 48, 51	fvmptd 6943	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) = if(𝑘 ∈ ℙ, 𝑘, 1))
53		breq1 5075	. . . . . 6 ⊢ (𝑥 = if(𝑘 ∈ ℙ, 𝑘, 1) → (𝑥 ∥ (lcm‘(1...𝑁)) ↔ if(𝑘 ∈ ℙ, 𝑘, 1) ∥ (lcm‘(1...𝑁))))
54	16	adantr 481	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((1...𝑁) ⊆ ℕ ∧ (1...𝑁) ∈ Fin))
55	17	2a1i 12	. . . . . . . 8 ⊢ ((1...𝑁) ∈ Fin → ((1...𝑁) ⊆ ℕ → (1...𝑁) ⊆ ℤ))
56	55	imdistanri 574	. . . . . . 7 ⊢ (((1...𝑁) ⊆ ℕ ∧ (1...𝑁) ∈ Fin) → ((1...𝑁) ⊆ ℤ ∧ (1...𝑁) ∈ Fin))
57		dvdslcmf 16591	. . . . . . 7 ⊢ (((1...𝑁) ⊆ ℤ ∧ (1...𝑁) ∈ Fin) → ∀𝑥 ∈ (1...𝑁)𝑥 ∥ (lcm‘(1...𝑁)))
58	54, 56, 57	3syl 18	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ∀𝑥 ∈ (1...𝑁)𝑥 ∥ (lcm‘(1...𝑁)))
59		elfzuz2 13474	. . . . . . . . 9 ⊢ (𝑘 ∈ (1...𝑁) → 𝑁 ∈ (ℤ≥‘1))
60	59	adantl 482	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑁 ∈ (ℤ≥‘1))
61		eluzfz1 13476	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘1) → 1 ∈ (1...𝑁))
62	60, 61	syl 17	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 1 ∈ (1...𝑁))
63	28, 62	ifcld 4501	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → if(𝑘 ∈ ℙ, 𝑘, 1) ∈ (1...𝑁))
64	53, 58, 63	rspcdva 3561	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → if(𝑘 ∈ ℙ, 𝑘, 1) ∥ (lcm‘(1...𝑁)))
65	52, 64	eqbrtrd 5094	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) ∥ (lcm‘(1...𝑁)))
66	65	ralrimiva 3131	. . 3 ⊢ (𝑁 ∈ ℕ0 → ∀𝑘 ∈ (1...𝑁)((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) ∥ (lcm‘(1...𝑁)))
67		coprmproddvds 16623	. . 3 ⊢ ((((1...𝑁) ⊆ ℕ ∧ (1...𝑁) ∈ Fin) ∧ ((lcm‘(1...𝑁)) ∈ ℕ ∧ (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1)):ℕ⟶ℕ) ∧ (∀𝑘 ∈ (1...𝑁)∀𝑥 ∈ ((1...𝑁) ∖ {𝑘})(((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) gcd ((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑥)) = 1 ∧ ∀𝑘 ∈ (1...𝑁)((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) ∥ (lcm‘(1...𝑁)))) → ∏𝑘 ∈ (1...𝑁)((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) ∥ (lcm‘(1...𝑁)))
68	16, 22, 27, 43, 66, 67	syl122anc 1387	. 2 ⊢ (𝑁 ∈ ℕ0 → ∏𝑘 ∈ (1...𝑁)((𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))‘𝑘) ∥ (lcm‘(1...𝑁)))
69	13, 68	eqbrtrd 5094	1 ⊢ (𝑁 ∈ ℕ0 → (#p‘𝑁) ∥ (lcm‘(1...𝑁)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119   ≠ wne 2934   ∉ wnel 3038  ∀wral 3053   ∖ cdif 3880   ⊆ wss 3883  ifcif 4454  {csn 4555   class class class wbr 5072   ↦ cmpt 5153  ⟶wf 6481  ‘cfv 6485  (class class class)co 7356  Fincfn 8883  0cc0 11029  1c1 11030  ℕcn 12165  ℕ₀cn0 12428  ℤcz 12515  ℤ_≥cuz 12779  ...cfz 13452  ∏cprod 15859   ∥ cdvds 16212   gcd cgcd 16454  lcmclcmf 16549  ℙcprime 16631  #_pcprmo 16993

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-inf2 9553  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-pre-sup 11107

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-isom 6494  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-2o 8396  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-sup 9345  df-inf 9346  df-oi 9415  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12166  df-2 12235  df-3 12236  df-n0 12429  df-z 12516  df-uz 12780  df-rp 12934  df-fz 13453  df-fzo 13600  df-fl 13742  df-mod 13820  df-seq 13955  df-exp 14015  df-hash 14284  df-cj 15052  df-re 15053  df-im 15054  df-sqrt 15188  df-abs 15189  df-clim 15441  df-prod 15860  df-dvds 16213  df-gcd 16455  df-lcmf 16551  df-prm 16632  df-prmo 16994

This theorem is referenced by:  prmolelcmf  17010