| 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 4350 | . . 3 ⊢ ∅ ⊆ ℤ | |
| 2 | 0fi 9054 | . . 3 ⊢ ∅ ∈ Fin | |
| 3 | noel 4284 | . . . 4 ⊢ ¬ 0 ∈ ∅ | |
| 4 | 3 | nelir 3065 | . . 3 ⊢ 0 ∉ ∅ |
| 5 | lcmfn0val 16778 | . . 3 ⊢ ((∅ ⊆ ℤ ∧ ∅ ∈ Fin ∧ 0 ∉ ∅) → (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < )) | |
| 6 | 1, 2, 4, 5 | mp3an 1490 | . 2 ⊢ (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) |
| 7 | ral0 4454 | . . . . . 6 ⊢ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 | |
| 8 | 7 | rgenw 3081 | . . . . 5 ⊢ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 |
| 9 | rabid2 3445 | . . . . 5 ⊢ (ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} ↔ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛) | |
| 10 | 8, 9 | mpbir 234 | . . . 4 ⊢ ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} |
| 11 | 10 | eqcomi 2770 | . . 3 ⊢ {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} = ℕ |
| 12 | 11 | infeq1i 9455 | . 2 ⊢ inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) = inf(ℕ, ℝ, < ) |
| 13 | nninf 13037 | . 2 ⊢ inf(ℕ, ℝ, < ) = 1 | |
| 14 | 6, 12, 13 | 3eqtri 2788 | 1 ⊢ (lcm‘∅) = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 ∉ wnel 3062 ∀wral 3077 {crab 3413 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 ‘cfv 6531 Fincfn 8957 infcinf 9417 ℝcr 11180 0cc0 11181 1c1 11182 < clt 11324 ℕcn 12316 ℤcz 12674 ∥ cdvds 16402 lcmclcmf 16744 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-oi 9488 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-rp 13102 df-fz 13621 df-fzo 13769 df-seq 14125 df-exp 14185 df-hash 14455 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-clim 15635 df-prod 16053 df-dvds 16403 df-lcmf 16746 |
| This theorem is used by: lcmfunsnlem 16796 lcmfun 16800 lcm1un 43031 |
| Copyright terms: Public domain | W3C validator |