MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pw2recs Structured version   Visualization version   GIF version

Theorem pw2recs 28883
Description: Any power of two has a multiplicative inverse. Note that this theorem does not require the axiom of infinity. (Contributed by Scott Fenton, 5-Sep-2025.)
Assertion
Ref Expression
pw2recs (𝑁 ∈ ℕ0s → ∃𝑥 ∈ No ((2s↑s𝑁) ·s 𝑥) = 1s )
Distinct variable group:   𝑥,𝑁

Proof of Theorem pw2recs
Dummy variables 𝑛 𝑚 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7458 . . . . . 6 (𝑚 = 0s → (2s↑s𝑚) = (2s↑s 0s ))
2 2no 28864 . . . . . . 7 2s ∈ No
3 exps0 28872 . . . . . . 7 (2s ∈ No → (2s↑s 0s ) = 1s )
42, 3ax-mp 5 . . . . . 6 (2s↑s 0s ) = 1s
51, 4eqtrdi 2817 . . . . 5 (𝑚 = 0s → (2s↑s𝑚) = 1s )
65oveq1d 7465 . . . 4 (𝑚 = 0s → ((2s↑s𝑚) ·s 𝑥) = ( 1s ·s 𝑥))
76eqeq1d 2768 . . 3 (𝑚 = 0s → (((2s↑s𝑚) ·s 𝑥) = 1s ↔ ( 1s ·s 𝑥) = 1s ))
87rexbidv 3193 . 2 (𝑚 = 0s → (∃𝑥 ∈ No ((2s↑s𝑚) ·s 𝑥) = 1s ↔ ∃𝑥 ∈ No ( 1s ·s 𝑥) = 1s ))
9 oveq2 7458 . . . . 5 (𝑚 = 𝑛 → (2s↑s𝑚) = (2s↑s𝑛))
109oveq1d 7465 . . . 4 (𝑚 = 𝑛 → ((2s↑s𝑚) ·s 𝑥) = ((2s↑s𝑛) ·s 𝑥))
1110eqeq1d 2768 . . 3 (𝑚 = 𝑛 → (((2s↑s𝑚) ·s 𝑥) = 1s ↔ ((2s↑s𝑛) ·s 𝑥) = 1s ))
1211rexbidv 3193 . 2 (𝑚 = 𝑛 → (∃𝑥 ∈ No ((2s↑s𝑚) ·s 𝑥) = 1s ↔ ∃𝑥 ∈ No ((2s↑s𝑛) ·s 𝑥) = 1s ))
13 oveq2 7458 . . . . . 6 (𝑚 = (𝑛 +s 1s ) → (2s↑s𝑚) = (2s↑s(𝑛 +s 1s )))
1413oveq1d 7465 . . . . 5 (𝑚 = (𝑛 +s 1s ) → ((2s↑s𝑚) ·s 𝑥) = ((2s↑s(𝑛 +s 1s )) ·s 𝑥))
1514eqeq1d 2768 . . . 4 (𝑚 = (𝑛 +s 1s ) → (((2s↑s𝑚) ·s 𝑥) = 1s ↔ ((2s↑s(𝑛 +s 1s )) ·s 𝑥) = 1s ))
1615rexbidv 3193 . . 3 (𝑚 = (𝑛 +s 1s ) → (∃𝑥 ∈ No ((2s↑s𝑚) ·s 𝑥) = 1s ↔ ∃𝑥 ∈ No ((2s↑s(𝑛 +s 1s )) ·s 𝑥) = 1s ))
17 oveq2 7458 . . . . 5 (𝑥 = 𝑦 → ((2s↑s(𝑛 +s 1s )) ·s 𝑥) = ((2s↑s(𝑛 +s 1s )) ·s 𝑦))
1817eqeq1d 2768 . . . 4 (𝑥 = 𝑦 → (((2s↑s(𝑛 +s 1s )) ·s 𝑥) = 1s ↔ ((2s↑s(𝑛 +s 1s )) ·s 𝑦) = 1s ))
1918cbvrexvw 3245 . . 3 (∃𝑥 ∈ No ((2s↑s(𝑛 +s 1s )) ·s 𝑥) = 1s ↔ ∃𝑦 ∈ No ((2s↑s(𝑛 +s 1s )) ·s 𝑦) = 1s )
2016, 19bitrdi 290 . 2 (𝑚 = (𝑛 +s 1s ) → (∃𝑥 ∈ No ((2s↑s𝑚) ·s 𝑥) = 1s ↔ ∃𝑦 ∈ No ((2s↑s(𝑛 +s 1s )) ·s 𝑦) = 1s ))
21 oveq2 7458 . . . . 5 (𝑚 = 𝑁 → (2s↑s𝑚) = (2s↑s𝑁))
2221oveq1d 7465 . . . 4 (𝑚 = 𝑁 → ((2s↑s𝑚) ·s 𝑥) = ((2s↑s𝑁) ·s 𝑥))
2322eqeq1d 2768 . . 3 (𝑚 = 𝑁 → (((2s↑s𝑚) ·s 𝑥) = 1s ↔ ((2s↑s𝑁) ·s 𝑥) = 1s ))
2423rexbidv 3193 . 2 (𝑚 = 𝑁 → (∃𝑥 ∈ No ((2s↑s𝑚) ·s 𝑥) = 1s ↔ ∃𝑥 ∈ No ((2s↑s𝑁) ·s 𝑥) = 1s ))
25 1no 28255 . . 3 1s ∈ No
26 mulsrid 28558 . . . 4 ( 1s ∈ No → ( 1s ·s 1s ) = 1s )
2725, 26ax-mp 5 . . 3 ( 1s ·s 1s ) = 1s
28 oveq2 7458 . . . . 5 (𝑥 = 1s → ( 1s ·s 𝑥) = ( 1s ·s 1s ))
2928eqeq1d 2768 . . . 4 (𝑥 = 1s → (( 1s ·s 𝑥) = 1s ↔ ( 1s ·s 1s ) = 1s ))
3029rspcev 3579 . . 3 (( 1s ∈ No ∧ ( 1s ·s 1s ) = 1s ) → ∃𝑥 ∈ No ( 1s ·s 𝑥) = 1s )
3125, 27, 30mp2an 705 . 2 ∃𝑥 ∈ No ( 1s ·s 𝑥) = 1s
32 oveq2 7458 . . . . 5 (𝑦 = (𝑥 ·s ({ 0s } |s { 1s })) → ((2s↑s(𝑛 +s 1s )) ·s 𝑦) = ((2s↑s(𝑛 +s 1s )) ·s (𝑥 ·s ({ 0s } |s { 1s }))))
3332eqeq1d 2768 . . . 4 (𝑦 = (𝑥 ·s ({ 0s } |s { 1s })) → (((2s↑s(𝑛 +s 1s )) ·s 𝑦) = 1s ↔ ((2s↑s(𝑛 +s 1s )) ·s (𝑥 ·s ({ 0s } |s { 1s }))) = 1s ))
34 simprl 783 . . . . 5 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → 𝑥 ∈ No)
35 0no 28254 . . . . . . . 8 0s ∈ No
3635a1i 11 . . . . . . 7 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → 0s ∈ No)
3725a1i 11 . . . . . . 7 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → 1s ∈ No)
38 0lt1s 28257 . . . . . . . 8 0s <s 1s
3938a1i 11 . . . . . . 7 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → 0s <s 1s )
4036, 37, 39sltssn 28215 . . . . . 6 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → { 0s } <<s { 1s })
4140cutscld 28228 . . . . 5 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → ({ 0s } |s { 1s }) ∈ No)
4234, 41mulscld 28580 . . . 4 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (𝑥 ·s ({ 0s } |s { 1s })) ∈ No)
43 expsp1 28874 . . . . . . . 8 ((2s ∈ No ∧ 𝑛 ∈ ℕ0s) → (2s↑s(𝑛 +s 1s )) = ((2s↑s𝑛) ·s 2s))
442, 43mpan 703 . . . . . . 7 (𝑛 ∈ ℕ0s → (2s↑s(𝑛 +s 1s )) = ((2s↑s𝑛) ·s 2s))
4544adantr 486 . . . . . 6 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (2s↑s(𝑛 +s 1s )) = ((2s↑s𝑛) ·s 2s))
4645oveq1d 7465 . . . . 5 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → ((2s↑s(𝑛 +s 1s )) ·s (𝑥 ·s ({ 0s } |s { 1s }))) = (((2s↑s𝑛) ·s 2s) ·s (𝑥 ·s ({ 0s } |s { 1s }))))
47 expscl 28876 . . . . . . . 8 ((2s ∈ No ∧ 𝑛 ∈ ℕ0s) → (2s↑s𝑛) ∈ No)
482, 47mpan 703 . . . . . . 7 (𝑛 ∈ ℕ0s → (2s↑s𝑛) ∈ No)
4948adantr 486 . . . . . 6 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (2s↑s𝑛) ∈ No)
502a1i 11 . . . . . 6 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → 2s ∈ No)
5149, 50, 34, 41muls4d 28613 . . . . 5 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (((2s↑s𝑛) ·s 2s) ·s (𝑥 ·s ({ 0s } |s { 1s }))) = (((2s↑s𝑛) ·s 𝑥) ·s (2s ·s ({ 0s } |s { 1s }))))
52 simprr 785 . . . . . . 7 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → ((2s↑s𝑛) ·s 𝑥) = 1s )
53 twocut 28868 . . . . . . . 8 (2s ·s ({ 0s } |s { 1s })) = 1s
5453a1i 11 . . . . . . 7 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (2s ·s ({ 0s } |s { 1s })) = 1s )
5552, 54oveq12d 7468 . . . . . 6 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (((2s↑s𝑛) ·s 𝑥) ·s (2s ·s ({ 0s } |s { 1s }))) = ( 1s ·s 1s ))
5655, 27eqtrdi 2817 . . . . 5 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → (((2s↑s𝑛) ·s 𝑥) ·s (2s ·s ({ 0s } |s { 1s }))) = 1s )
5746, 51, 563eqtrd 2805 . . . 4 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → ((2s↑s(𝑛 +s 1s )) ·s (𝑥 ·s ({ 0s } |s { 1s }))) = 1s )
5833, 42, 57rspcedvdw 3582 . . 3 ((𝑛 ∈ ℕ0s ∧ (𝑥 ∈ No ∧ ((2s↑s𝑛) ·s 𝑥) = 1s )) → ∃𝑦 ∈ No ((2s↑s(𝑛 +s 1s )) ·s 𝑦) = 1s )
5958rexlimdvaa 3171 . 2 (𝑛 ∈ ℕ0s → (∃𝑥 ∈ No ((2s↑s𝑛) ·s 𝑥) = 1s → ∃𝑦 ∈ No ((2s↑s(𝑛 +s 1s )) ·s 𝑦) = 1s ))
608, 12, 20, 24, 31, 59n0sind 28778 1 (𝑁 ∈ ℕ0s → ∃𝑥 ∈ No ((2s↑s𝑁) ·s 𝑥) = 1s )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∃wrex 3093  {csn 4587   class class class wbr 5107  (class class class)co 7450  Nocsur 28056   <s clts 28057   |s ccuts 28204   0s c0s 28250   1s c1s 28251   +s cadds 28404   ·s cmuls 28551  ℕ0scn0s 28757  2sc2s 28855  ↑scexps 28857
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-ot 4863  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-oadd 8517  df-nadd 8712  df-no 28059  df-lts 28060  df-bday 28061  df-les 28161  df-slts 28203  df-cuts 28205  df-0s 28252  df-1s 28253  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-norec 28383  df-norec2 28394  df-adds 28405  df-negs 28466  df-subs 28467  df-muls 28552  df-seqs 28729  df-n0s 28759  df-nns 28760  df-zs 28824  df-2s 28856  df-exps 28858
This theorem is used by:  pw2divscld  28884  pw2divmulsd  28885  pw2divscan2d  28887  pw2divsassd  28888  pw2ltdivmulsd  28895  pw2ltmuldivs2d  28896  pw2ltdivmuls2d  28902  z12zsodd  28927
  Copyright terms: Public domain W3C validator