Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > pw2dvdseulemle | GIF version |
Description: Lemma for pw2dvdseu 11835. Powers of two which do and do not divide a natural number. (Contributed by Jim Kingdon, 17-Nov-2021.) |
Ref | Expression |
---|---|
pw2dvdseulemle.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
pw2dvdseulemle.a | ⊢ (𝜑 → 𝐴 ∈ ℕ0) |
pw2dvdseulemle.b | ⊢ (𝜑 → 𝐵 ∈ ℕ0) |
pw2dvdseulemle.2a | ⊢ (𝜑 → (2↑𝐴) ∥ 𝑁) |
pw2dvdseulemle.n2b | ⊢ (𝜑 → ¬ (2↑(𝐵 + 1)) ∥ 𝑁) |
Ref | Expression |
---|---|
pw2dvdseulemle | ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pw2dvdseulemle.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℕ0) | |
2 | 1 | nn0red 9024 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
3 | pw2dvdseulemle.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℕ0) | |
4 | 3 | nn0red 9024 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) |
5 | pw2dvdseulemle.n2b | . . 3 ⊢ (𝜑 → ¬ (2↑(𝐵 + 1)) ∥ 𝑁) | |
6 | 2cnd 8786 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 2 ∈ ℂ) | |
7 | 3 | adantr 274 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 𝐵 ∈ ℕ0) |
8 | peano2nn0 9010 | . . . . . . . 8 ⊢ (𝐵 ∈ ℕ0 → (𝐵 + 1) ∈ ℕ0) | |
9 | 7, 8 | syl 14 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐵 + 1) ∈ ℕ0) |
10 | 1 | adantr 274 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 𝐴 ∈ ℕ0) |
11 | simpr 109 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 𝐵 < 𝐴) | |
12 | nn0ltp1le 9109 | . . . . . . . . 9 ⊢ ((𝐵 ∈ ℕ0 ∧ 𝐴 ∈ ℕ0) → (𝐵 < 𝐴 ↔ (𝐵 + 1) ≤ 𝐴)) | |
13 | 7, 10, 12 | syl2anc 408 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐵 < 𝐴 ↔ (𝐵 + 1) ≤ 𝐴)) |
14 | 11, 13 | mpbid 146 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐵 + 1) ≤ 𝐴) |
15 | nn0sub2 9117 | . . . . . . 7 ⊢ (((𝐵 + 1) ∈ ℕ0 ∧ 𝐴 ∈ ℕ0 ∧ (𝐵 + 1) ≤ 𝐴) → (𝐴 − (𝐵 + 1)) ∈ ℕ0) | |
16 | 9, 10, 14, 15 | syl3anc 1216 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐴 − (𝐵 + 1)) ∈ ℕ0) |
17 | 6, 16, 9 | expaddd 10419 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑((𝐵 + 1) + (𝐴 − (𝐵 + 1)))) = ((2↑(𝐵 + 1)) · (2↑(𝐴 − (𝐵 + 1))))) |
18 | 9 | nn0cnd 9025 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (𝐵 + 1) ∈ ℂ) |
19 | 10 | nn0cnd 9025 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 𝐴 ∈ ℂ) |
20 | 18, 19 | pncan3d 8069 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ((𝐵 + 1) + (𝐴 − (𝐵 + 1))) = 𝐴) |
21 | 20 | oveq2d 5783 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑((𝐵 + 1) + (𝐴 − (𝐵 + 1)))) = (2↑𝐴)) |
22 | pw2dvdseulemle.2a | . . . . . . 7 ⊢ (𝜑 → (2↑𝐴) ∥ 𝑁) | |
23 | 22 | adantr 274 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑𝐴) ∥ 𝑁) |
24 | 21, 23 | eqbrtrd 3945 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑((𝐵 + 1) + (𝐴 − (𝐵 + 1)))) ∥ 𝑁) |
25 | 17, 24 | eqbrtrrd 3947 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → ((2↑(𝐵 + 1)) · (2↑(𝐴 − (𝐵 + 1)))) ∥ 𝑁) |
26 | 2nn 8874 | . . . . . . . 8 ⊢ 2 ∈ ℕ | |
27 | 26 | a1i 9 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 2 ∈ ℕ) |
28 | 27, 9 | nnexpcld 10439 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑(𝐵 + 1)) ∈ ℕ) |
29 | 28 | nnzd 9165 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑(𝐵 + 1)) ∈ ℤ) |
30 | 27, 16 | nnexpcld 10439 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑(𝐴 − (𝐵 + 1))) ∈ ℕ) |
31 | 30 | nnzd 9165 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑(𝐴 − (𝐵 + 1))) ∈ ℤ) |
32 | pw2dvdseulemle.n | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
33 | 32 | adantr 274 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 𝑁 ∈ ℕ) |
34 | 33 | nnzd 9165 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → 𝑁 ∈ ℤ) |
35 | muldvds1 11507 | . . . . 5 ⊢ (((2↑(𝐵 + 1)) ∈ ℤ ∧ (2↑(𝐴 − (𝐵 + 1))) ∈ ℤ ∧ 𝑁 ∈ ℤ) → (((2↑(𝐵 + 1)) · (2↑(𝐴 − (𝐵 + 1)))) ∥ 𝑁 → (2↑(𝐵 + 1)) ∥ 𝑁)) | |
36 | 29, 31, 34, 35 | syl3anc 1216 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (((2↑(𝐵 + 1)) · (2↑(𝐴 − (𝐵 + 1)))) ∥ 𝑁 → (2↑(𝐵 + 1)) ∥ 𝑁)) |
37 | 25, 36 | mpd 13 | . . 3 ⊢ ((𝜑 ∧ 𝐵 < 𝐴) → (2↑(𝐵 + 1)) ∥ 𝑁) |
38 | 5, 37 | mtand 654 | . 2 ⊢ (𝜑 → ¬ 𝐵 < 𝐴) |
39 | 2, 4, 38 | nltled 7876 | 1 ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1480 class class class wbr 3924 (class class class)co 5767 1c1 7614 + caddc 7616 · cmul 7618 < clt 7793 ≤ cle 7794 − cmin 7926 ℕcn 8713 2c2 8764 ℕ0cn0 8970 ℤcz 9047 ↑cexp 10285 ∥ cdvds 11482 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-coll 4038 ax-sep 4041 ax-nul 4049 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 ax-iinf 4497 ax-cnex 7704 ax-resscn 7705 ax-1cn 7706 ax-1re 7707 ax-icn 7708 ax-addcl 7709 ax-addrcl 7710 ax-mulcl 7711 ax-mulrcl 7712 ax-addcom 7713 ax-mulcom 7714 ax-addass 7715 ax-mulass 7716 ax-distr 7717 ax-i2m1 7718 ax-0lt1 7719 ax-1rid 7720 ax-0id 7721 ax-rnegex 7722 ax-precex 7723 ax-cnre 7724 ax-pre-ltirr 7725 ax-pre-ltwlin 7726 ax-pre-lttrn 7727 ax-pre-apti 7728 ax-pre-ltadd 7729 ax-pre-mulgt0 7730 ax-pre-mulext 7731 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-nel 2402 df-ral 2419 df-rex 2420 df-reu 2421 df-rmo 2422 df-rab 2423 df-v 2683 df-sbc 2905 df-csb 2999 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-nul 3359 df-if 3470 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-iun 3810 df-br 3925 df-opab 3985 df-mpt 3986 df-tr 4022 df-id 4210 df-po 4213 df-iso 4214 df-iord 4283 df-on 4285 df-ilim 4286 df-suc 4288 df-iom 4500 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-rn 4545 df-res 4546 df-ima 4547 df-iota 5083 df-fun 5120 df-fn 5121 df-f 5122 df-f1 5123 df-fo 5124 df-f1o 5125 df-fv 5126 df-riota 5723 df-ov 5770 df-oprab 5771 df-mpo 5772 df-1st 6031 df-2nd 6032 df-recs 6195 df-frec 6281 df-pnf 7795 df-mnf 7796 df-xr 7797 df-ltxr 7798 df-le 7799 df-sub 7928 df-neg 7929 df-reap 8330 df-ap 8337 df-div 8426 df-inn 8714 df-2 8772 df-n0 8971 df-z 9048 df-uz 9320 df-seqfrec 10212 df-exp 10286 df-dvds 11483 |
This theorem is referenced by: pw2dvdseu 11835 |
Copyright terms: Public domain | W3C validator |