| 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 4360 | . . 3 ⊢ ∅ ⊆ ℤ | |
| 2 | 0fi 9049 | . . 3 ⊢ ∅ ∈ Fin | |
| 3 | noel 4294 | . . . 4 ⊢ ¬ 0 ∈ ∅ | |
| 4 | 3 | nelir 3070 | . . 3 ⊢ 0 ∉ ∅ |
| 5 | lcmfn0val 16706 | . . 3 ⊢ ((∅ ⊆ ℤ ∧ ∅ ∈ Fin ∧ 0 ∉ ∅) → (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < )) | |
| 6 | 1, 2, 4, 5 | mp3an 1490 | . 2 ⊢ (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) |
| 7 | ral0 4464 | . . . . . 6 ⊢ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 | |
| 8 | 7 | rgenw 3086 | . . . . 5 ⊢ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 |
| 9 | rabid2 3452 | . . . . 5 ⊢ (ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} ↔ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛) | |
| 10 | 8, 9 | mpbir 234 | . . . 4 ⊢ ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} |
| 11 | 10 | eqcomi 2775 | . . 3 ⊢ {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} = ℕ |
| 12 | 11 | infeq1i 9449 | . 2 ⊢ inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) = inf(ℕ, ℝ, < ) |
| 13 | nninf 12971 | . 2 ⊢ inf(ℕ, ℝ, < ) = 1 | |
| 14 | 6, 12, 13 | 3eqtri 2793 | 1 ⊢ (lcm‘∅) = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2146 ∉ wnel 3067 ∀wral 3082 {crab 3419 ⊆ wss 3908 ∅c0 4289 class class class wbr 5114 ‘cfv 6543 Fincfn 8952 infcinf 9411 ℝcr 11117 0cc0 11118 1c1 11119 < clt 11261 ℕcn 12251 ℤcz 12609 ∥ cdvds 16335 lcmclcmf 16672 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-rp 13035 df-fz 13554 df-fzo 13702 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-prod 15984 df-dvds 16336 df-lcmf 16674 |
| This theorem is used by: lcmfunsnlem 16724 lcmfun 16728 lcm1un 42821 |
| Copyright terms: Public domain | W3C validator |