![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lcmf0 | Structured version Visualization version GIF version |
Description: The least common multiple of the empty set is 1. (Contributed by AV, 22-Aug-2020.) (Proof shortened by AV, 16-Sep-2020.) |
Ref | Expression |
---|---|
lcmf0 | ⊢ (lcm‘∅) = 1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ss 4389 | . . 3 ⊢ ∅ ⊆ ℤ | |
2 | 0fin 9168 | . . 3 ⊢ ∅ ∈ Fin | |
3 | noel 4323 | . . . 4 ⊢ ¬ 0 ∈ ∅ | |
4 | 3 | nelir 3041 | . . 3 ⊢ 0 ∉ ∅ |
5 | lcmfn0val 16563 | . . 3 ⊢ ((∅ ⊆ ℤ ∧ ∅ ∈ Fin ∧ 0 ∉ ∅) → (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < )) | |
6 | 1, 2, 4, 5 | mp3an 1457 | . 2 ⊢ (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) |
7 | ral0 4505 | . . . . . 6 ⊢ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 | |
8 | 7 | rgenw 3057 | . . . . 5 ⊢ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 |
9 | rabid2 3456 | . . . . 5 ⊢ (ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} ↔ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛) | |
10 | 8, 9 | mpbir 230 | . . . 4 ⊢ ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} |
11 | 10 | eqcomi 2733 | . . 3 ⊢ {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} = ℕ |
12 | 11 | infeq1i 9470 | . 2 ⊢ inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) = inf(ℕ, ℝ, < ) |
13 | nninf 12912 | . 2 ⊢ inf(ℕ, ℝ, < ) = 1 | |
14 | 6, 12, 13 | 3eqtri 2756 | 1 ⊢ (lcm‘∅) = 1 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2098 ∉ wnel 3038 ∀wral 3053 {crab 3424 ⊆ wss 3941 ∅c0 4315 class class class wbr 5139 ‘cfv 6534 Fincfn 8936 infcinf 9433 ℝcr 11106 0cc0 11107 1c1 11108 < clt 11247 ℕcn 12211 ℤcz 12557 ∥ cdvds 16200 lcmclcmf 16529 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-inf2 9633 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-pss 3960 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-int 4942 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-tr 5257 df-id 5565 df-eprel 5571 df-po 5579 df-so 5580 df-fr 5622 df-se 5623 df-we 5624 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-pred 6291 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-isom 6543 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-om 7850 df-1st 7969 df-2nd 7970 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-sup 9434 df-inf 9435 df-oi 9502 df-card 9931 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-nn 12212 df-2 12274 df-3 12275 df-n0 12472 df-z 12558 df-uz 12822 df-rp 12976 df-fz 13486 df-fzo 13629 df-seq 13968 df-exp 14029 df-hash 14292 df-cj 15048 df-re 15049 df-im 15050 df-sqrt 15184 df-abs 15185 df-clim 15434 df-prod 15852 df-dvds 16201 df-lcmf 16531 |
This theorem is referenced by: lcmfunsnlem 16581 lcmfun 16585 lcm1un 41384 |
Copyright terms: Public domain | W3C validator |