| 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 4351 | . . 3 ⊢ ∅ ⊆ ℤ | |
| 2 | 0fi 8967 | . . 3 ⊢ ∅ ∈ Fin | |
| 3 | noel 4289 | . . . 4 ⊢ ¬ 0 ∈ ∅ | |
| 4 | 3 | nelir 3032 | . . 3 ⊢ 0 ∉ ∅ |
| 5 | lcmfn0val 16534 | . . 3 ⊢ ((∅ ⊆ ℤ ∧ ∅ ∈ Fin ∧ 0 ∉ ∅) → (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < )) | |
| 6 | 1, 2, 4, 5 | mp3an 1463 | . 2 ⊢ (lcm‘∅) = inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) |
| 7 | ral0 4464 | . . . . . 6 ⊢ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 | |
| 8 | 7 | rgenw 3048 | . . . . 5 ⊢ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛 |
| 9 | rabid2 3428 | . . . . 5 ⊢ (ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} ↔ ∀𝑛 ∈ ℕ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛) | |
| 10 | 8, 9 | mpbir 231 | . . . 4 ⊢ ℕ = {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} |
| 11 | 10 | eqcomi 2738 | . . 3 ⊢ {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛} = ℕ |
| 12 | 11 | infeq1i 9369 | . 2 ⊢ inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ ∅ 𝑚 ∥ 𝑛}, ℝ, < ) = inf(ℕ, ℝ, < ) |
| 13 | nninf 12830 | . 2 ⊢ inf(ℕ, ℝ, < ) = 1 | |
| 14 | 6, 12, 13 | 3eqtri 2756 | 1 ⊢ (lcm‘∅) = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 ∉ wnel 3029 ∀wral 3044 {crab 3394 ⊆ wss 3903 ∅c0 4284 class class class wbr 5092 ‘cfv 6482 Fincfn 8872 infcinf 9331 ℝcr 11008 0cc0 11009 1c1 11010 < clt 11149 ℕcn 12128 ℤcz 12471 ∥ cdvds 16163 lcmclcmf 16500 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-inf2 9537 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-pre-sup 11087 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-isom 6491 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-sup 9332 df-inf 9333 df-oi 9402 df-card 9835 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-2 12191 df-3 12192 df-n0 12385 df-z 12472 df-uz 12736 df-rp 12894 df-fz 13411 df-fzo 13558 df-seq 13909 df-exp 13969 df-hash 14238 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 df-clim 15395 df-prod 15811 df-dvds 16164 df-lcmf 16502 |
| This theorem is referenced by: lcmfunsnlem 16552 lcmfun 16556 lcm1un 41986 |
| Copyright terms: Public domain | W3C validator |