| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fzo0dvdseq | Structured version Visualization version GIF version | ||
| Description: Zero is the only one of the first 𝐴 nonnegative integers that is divisible by 𝐴. (Contributed by Stefan O'Rear, 6-Sep-2015.) |
| Ref | Expression |
|---|---|
| fzo0dvdseq | ⊢ (𝐵 ∈ (0..^𝐴) → (𝐴 ∥ 𝐵 ↔ 𝐵 = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzolt2 13696 | . . . . . . 7 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 < 𝐴) | |
| 2 | elfzoelz 13686 | . . . . . . . . 9 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 ∈ ℤ) | |
| 3 | 2 | zred 12699 | . . . . . . . 8 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 ∈ ℝ) |
| 4 | elfzoel2 13685 | . . . . . . . . 9 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐴 ∈ ℤ) | |
| 5 | 4 | zred 12699 | . . . . . . . 8 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐴 ∈ ℝ) |
| 6 | 3, 5 | ltnled 11356 | . . . . . . 7 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐵 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐵)) |
| 7 | 1, 6 | mpbid 235 | . . . . . 6 ⊢ (𝐵 ∈ (0..^𝐴) → ¬ 𝐴 ≤ 𝐵) |
| 8 | 7 | adantr 485 | . . . . 5 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → ¬ 𝐴 ≤ 𝐵) |
| 9 | elfzonn0 13735 | . . . . . . . . 9 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 ∈ ℕ0) | |
| 10 | 9 | adantr 485 | . . . . . . . 8 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℕ0) |
| 11 | simpr 489 | . . . . . . . 8 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ≠ 0) | |
| 12 | eldifsn 4758 | . . . . . . . 8 ⊢ (𝐵 ∈ (ℕ0 ∖ {0}) ↔ (𝐵 ∈ ℕ0 ∧ 𝐵 ≠ 0)) | |
| 13 | 10, 11, 12 | sylanbrc 594 | . . . . . . 7 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ∈ (ℕ0 ∖ {0})) |
| 14 | dfn2 12516 | . . . . . . 7 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 15 | 13, 14 | eleqtrrdi 2880 | . . . . . 6 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℕ) |
| 16 | dvdsle 16367 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ) → (𝐴 ∥ 𝐵 → 𝐴 ≤ 𝐵)) | |
| 17 | 4, 15, 16 | syl2an2r 697 | . . . . 5 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → (𝐴 ∥ 𝐵 → 𝐴 ≤ 𝐵)) |
| 18 | 8, 17 | mtod 201 | . . . 4 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → ¬ 𝐴 ∥ 𝐵) |
| 19 | 18 | ex 417 | . . 3 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐵 ≠ 0 → ¬ 𝐴 ∥ 𝐵)) |
| 20 | 19 | necon4ad 2983 | . 2 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐴 ∥ 𝐵 → 𝐵 = 0)) |
| 21 | dvds0 16328 | . . . 4 ⊢ (𝐴 ∈ ℤ → 𝐴 ∥ 0) | |
| 22 | 4, 21 | syl 18 | . . 3 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐴 ∥ 0) |
| 23 | breq2 5117 | . . 3 ⊢ (𝐵 = 0 → (𝐴 ∥ 𝐵 ↔ 𝐴 ∥ 0)) | |
| 24 | 22, 23 | syl5ibrcom 250 | . 2 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐵 = 0 → 𝐴 ∥ 𝐵)) |
| 25 | 20, 24 | impbid 215 | 1 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐴 ∥ 𝐵 ↔ 𝐵 = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∖ cdif 3910 {csn 4594 class class class wbr 5113 (class class class)co 7411 0cc0 11099 < clt 11242 ≤ cle 11243 ℕcn 12232 ℕ0cn0 12503 ℤcz 12590 ..^cfzo 13681 ∥ cdvds 16309 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-n0 12504 df-z 12591 df-uz 12862 df-fz 13535 df-fzo 13682 df-dvds 16310 |
| This theorem is referenced by: fzocongeq 16381 |
| Copyright terms: Public domain | W3C validator |