| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzo0dvdseq | 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 10299 | . . . . . . 7 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 < 𝐴) | |
| 2 | elfzoelz 10289 | . . . . . . . 8 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 ∈ ℤ) | |
| 3 | elfzoel2 10288 | . . . . . . . 8 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐴 ∈ ℤ) | |
| 4 | zltnle 9438 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝐵 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐵)) | |
| 5 | 2, 3, 4 | syl2anc 411 | . . . . . . 7 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐵 < 𝐴 ↔ ¬ 𝐴 ≤ 𝐵)) |
| 6 | 1, 5 | mpbid 147 | . . . . . 6 ⊢ (𝐵 ∈ (0..^𝐴) → ¬ 𝐴 ≤ 𝐵) |
| 7 | 6 | adantr 276 | . . . . 5 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐴 ∥ 𝐵) → ¬ 𝐴 ≤ 𝐵) |
| 8 | 3 | adantr 276 | . . . . . . 7 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐴 ∈ ℤ) |
| 9 | elfzonn0 10332 | . . . . . . . . . 10 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐵 ∈ ℕ0) | |
| 10 | 9 | adantr 276 | . . . . . . . . 9 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℕ0) |
| 11 | simpr 110 | . . . . . . . . 9 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ≠ 0) | |
| 12 | eldifsn 3766 | . . . . . . . . 9 ⊢ (𝐵 ∈ (ℕ0 ∖ {0}) ↔ (𝐵 ∈ ℕ0 ∧ 𝐵 ≠ 0)) | |
| 13 | 10, 11, 12 | sylanbrc 417 | . . . . . . . 8 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ∈ (ℕ0 ∖ {0})) |
| 14 | dfn2 9328 | . . . . . . . 8 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 15 | 13, 14 | eleqtrrdi 2300 | . . . . . . 7 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℕ) |
| 16 | dvdsle 12230 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ) → (𝐴 ∥ 𝐵 → 𝐴 ≤ 𝐵)) | |
| 17 | 8, 15, 16 | syl2anc 411 | . . . . . 6 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐵 ≠ 0) → (𝐴 ∥ 𝐵 → 𝐴 ≤ 𝐵)) |
| 18 | 17 | impancom 260 | . . . . 5 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐴 ∥ 𝐵) → (𝐵 ≠ 0 → 𝐴 ≤ 𝐵)) |
| 19 | 7, 18 | mtod 665 | . . . 4 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐴 ∥ 𝐵) → ¬ 𝐵 ≠ 0) |
| 20 | 0z 9403 | . . . . . . . 8 ⊢ 0 ∈ ℤ | |
| 21 | zdceq 9468 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝐵 = 0) | |
| 22 | 20, 21 | mpan2 425 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → DECID 𝐵 = 0) |
| 23 | nnedc 2382 | . . . . . . 7 ⊢ (DECID 𝐵 = 0 → (¬ 𝐵 ≠ 0 ↔ 𝐵 = 0)) | |
| 24 | 22, 23 | syl 14 | . . . . . 6 ⊢ (𝐵 ∈ ℤ → (¬ 𝐵 ≠ 0 ↔ 𝐵 = 0)) |
| 25 | 2, 24 | syl 14 | . . . . 5 ⊢ (𝐵 ∈ (0..^𝐴) → (¬ 𝐵 ≠ 0 ↔ 𝐵 = 0)) |
| 26 | 25 | adantr 276 | . . . 4 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐴 ∥ 𝐵) → (¬ 𝐵 ≠ 0 ↔ 𝐵 = 0)) |
| 27 | 19, 26 | mpbid 147 | . . 3 ⊢ ((𝐵 ∈ (0..^𝐴) ∧ 𝐴 ∥ 𝐵) → 𝐵 = 0) |
| 28 | 27 | ex 115 | . 2 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐴 ∥ 𝐵 → 𝐵 = 0)) |
| 29 | dvds0 12192 | . . . 4 ⊢ (𝐴 ∈ ℤ → 𝐴 ∥ 0) | |
| 30 | 3, 29 | syl 14 | . . 3 ⊢ (𝐵 ∈ (0..^𝐴) → 𝐴 ∥ 0) |
| 31 | breq2 4055 | . . 3 ⊢ (𝐵 = 0 → (𝐴 ∥ 𝐵 ↔ 𝐴 ∥ 0)) | |
| 32 | 30, 31 | syl5ibrcom 157 | . 2 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐵 = 0 → 𝐴 ∥ 𝐵)) |
| 33 | 28, 32 | impbid 129 | 1 ⊢ (𝐵 ∈ (0..^𝐴) → (𝐴 ∥ 𝐵 ↔ 𝐵 = 0)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 836 = wceq 1373 ∈ wcel 2177 ≠ wne 2377 ∖ cdif 3167 {csn 3638 class class class wbr 4051 (class class class)co 5957 0cc0 7945 < clt 8127 ≤ cle 8128 ℕcn 9056 ℕ0cn0 9315 ℤcz 9392 ..^cfzo 10284 ∥ cdvds 12173 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4170 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-mulrcl 8044 ax-addcom 8045 ax-mulcom 8046 ax-addass 8047 ax-mulass 8048 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-1rid 8052 ax-0id 8053 ax-rnegex 8054 ax-precex 8055 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-apti 8060 ax-pre-ltadd 8061 ax-pre-mulgt0 8062 ax-pre-mulext 8063 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-id 4348 df-po 4351 df-iso 4352 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-1st 6239 df-2nd 6240 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-reap 8668 df-ap 8675 df-div 8766 df-inn 9057 df-n0 9316 df-z 9393 df-uz 9669 df-q 9761 df-fz 10151 df-fzo 10285 df-dvds 12174 |
| This theorem is referenced by: fzocongeq 12244 |
| Copyright terms: Public domain | W3C validator |