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

Theorem bitsf1 16479
Description: The bits function is an injection from to 𝒫 ℕ0. It is obviously not a bijection (by Cantor's theorem canth2 9168), and in fact its range is the set of finite and cofinite subsets of 0. (Contributed by Mario Carneiro, 22-Sep-2016.)
Assertion
Ref Expression
bitsf1 bits:ℤ–1-1→𝒫 ℕ0

Proof of Theorem bitsf1
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bitsf 16460 . 2 bits:ℤ⟶𝒫 ℕ0
2 simpl 482 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → 𝑥 ∈ ℤ)
32zcnd 12720 . . . . . . 7 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → 𝑥 ∈ ℂ)
43adantr 480 . . . . . 6 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → 𝑥 ∈ ℂ)
5 simpr 484 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℤ)
65zcnd 12720 . . . . . . 7 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℂ)
76adantr 480 . . . . . 6 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → 𝑦 ∈ ℂ)
84negcld 11604 . . . . . . 7 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → -𝑥 ∈ ℂ)
97negcld 11604 . . . . . . 7 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → -𝑦 ∈ ℂ)
10 1cnd 11253 . . . . . . 7 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → 1 ∈ ℂ)
11 simprr 773 . . . . . . . . . . 11 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (bits‘𝑥) = (bits‘𝑦))
1211difeq2d 4135 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (ℕ0 ∖ (bits‘𝑥)) = (ℕ0 ∖ (bits‘𝑦)))
13 bitscmp 16471 . . . . . . . . . . 11 (𝑥 ∈ ℤ → (ℕ0 ∖ (bits‘𝑥)) = (bits‘(-𝑥 − 1)))
1413ad2antrr 726 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (ℕ0 ∖ (bits‘𝑥)) = (bits‘(-𝑥 − 1)))
15 bitscmp 16471 . . . . . . . . . . 11 (𝑦 ∈ ℤ → (ℕ0 ∖ (bits‘𝑦)) = (bits‘(-𝑦 − 1)))
1615ad2antlr 727 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (ℕ0 ∖ (bits‘𝑦)) = (bits‘(-𝑦 − 1)))
1712, 14, 163eqtr3d 2782 . . . . . . . . 9 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (bits‘(-𝑥 − 1)) = (bits‘(-𝑦 − 1)))
18 nnm1nn0 12564 . . . . . . . . . . 11 (-𝑥 ∈ ℕ → (-𝑥 − 1) ∈ ℕ0)
1918ad2antrl 728 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (-𝑥 − 1) ∈ ℕ0)
2019fvresd 6926 . . . . . . . . 9 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → ((bits ↾ ℕ0)‘(-𝑥 − 1)) = (bits‘(-𝑥 − 1)))
21 ominf 9291 . . . . . . . . . . . . . . . . 17 ¬ ω ∈ Fin
22 nn0ennn 14016 . . . . . . . . . . . . . . . . . . 19 0 ≈ ℕ
23 nnenom 14017 . . . . . . . . . . . . . . . . . . 19 ℕ ≈ ω
2422, 23entr2i 9047 . . . . . . . . . . . . . . . . . 18 ω ≈ ℕ0
25 enfii 9223 . . . . . . . . . . . . . . . . . 18 ((ℕ0 ∈ Fin ∧ ω ≈ ℕ0) → ω ∈ Fin)
2624, 25mpan2 691 . . . . . . . . . . . . . . . . 17 (ℕ0 ∈ Fin → ω ∈ Fin)
2721, 26mto 197 . . . . . . . . . . . . . . . 16 ¬ ℕ0 ∈ Fin
28 difinf 9346 . . . . . . . . . . . . . . . 16 ((¬ ℕ0 ∈ Fin ∧ (bits‘𝑥) ∈ Fin) → ¬ (ℕ0 ∖ (bits‘𝑥)) ∈ Fin)
2927, 28mpan 690 . . . . . . . . . . . . . . 15 ((bits‘𝑥) ∈ Fin → ¬ (ℕ0 ∖ (bits‘𝑥)) ∈ Fin)
30 bitsfi 16470 . . . . . . . . . . . . . . . . 17 ((-𝑥 − 1) ∈ ℕ0 → (bits‘(-𝑥 − 1)) ∈ Fin)
3119, 30syl 17 . . . . . . . . . . . . . . . 16 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (bits‘(-𝑥 − 1)) ∈ Fin)
3214, 31eqeltrd 2838 . . . . . . . . . . . . . . 15 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (ℕ0 ∖ (bits‘𝑥)) ∈ Fin)
3329, 32nsyl3 138 . . . . . . . . . . . . . 14 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ (bits‘𝑥) ∈ Fin)
3411, 33eqneltrrd 2859 . . . . . . . . . . . . 13 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ (bits‘𝑦) ∈ Fin)
35 bitsfi 16470 . . . . . . . . . . . . 13 (𝑦 ∈ ℕ0 → (bits‘𝑦) ∈ Fin)
3634, 35nsyl 140 . . . . . . . . . . . 12 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ 𝑦 ∈ ℕ0)
375znegcld 12721 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → -𝑦 ∈ ℤ)
38 elznn 12626 . . . . . . . . . . . . . . . . 17 (-𝑦 ∈ ℤ ↔ (-𝑦 ∈ ℝ ∧ (-𝑦 ∈ ℕ ∨ --𝑦 ∈ ℕ0)))
3938simprbi 496 . . . . . . . . . . . . . . . 16 (-𝑦 ∈ ℤ → (-𝑦 ∈ ℕ ∨ --𝑦 ∈ ℕ0))
4037, 39syl 17 . . . . . . . . . . . . . . 15 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (-𝑦 ∈ ℕ ∨ --𝑦 ∈ ℕ0))
416negnegd 11608 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → --𝑦 = 𝑦)
4241eleq1d 2823 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (--𝑦 ∈ ℕ0𝑦 ∈ ℕ0))
4342orbi2d 915 . . . . . . . . . . . . . . 15 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((-𝑦 ∈ ℕ ∨ --𝑦 ∈ ℕ0) ↔ (-𝑦 ∈ ℕ ∨ 𝑦 ∈ ℕ0)))
4440, 43mpbid 232 . . . . . . . . . . . . . 14 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (-𝑦 ∈ ℕ ∨ 𝑦 ∈ ℕ0))
4544adantr 480 . . . . . . . . . . . . 13 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (-𝑦 ∈ ℕ ∨ 𝑦 ∈ ℕ0))
4645ord 864 . . . . . . . . . . . 12 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (¬ -𝑦 ∈ ℕ → 𝑦 ∈ ℕ0))
4736, 46mt3d 148 . . . . . . . . . . 11 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → -𝑦 ∈ ℕ)
48 nnm1nn0 12564 . . . . . . . . . . 11 (-𝑦 ∈ ℕ → (-𝑦 − 1) ∈ ℕ0)
4947, 48syl 17 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (-𝑦 − 1) ∈ ℕ0)
5049fvresd 6926 . . . . . . . . 9 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → ((bits ↾ ℕ0)‘(-𝑦 − 1)) = (bits‘(-𝑦 − 1)))
5117, 20, 503eqtr4d 2784 . . . . . . . 8 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → ((bits ↾ ℕ0)‘(-𝑥 − 1)) = ((bits ↾ ℕ0)‘(-𝑦 − 1)))
52 bitsf1o 16478 . . . . . . . . . . 11 (bits ↾ ℕ0):ℕ01-1-onto→(𝒫 ℕ0 ∩ Fin)
53 f1of1 6847 . . . . . . . . . . 11 ((bits ↾ ℕ0):ℕ01-1-onto→(𝒫 ℕ0 ∩ Fin) → (bits ↾ ℕ0):ℕ01-1→(𝒫 ℕ0 ∩ Fin))
5452, 53ax-mp 5 . . . . . . . . . 10 (bits ↾ ℕ0):ℕ01-1→(𝒫 ℕ0 ∩ Fin)
55 f1fveq 7281 . . . . . . . . . 10 (((bits ↾ ℕ0):ℕ01-1→(𝒫 ℕ0 ∩ Fin) ∧ ((-𝑥 − 1) ∈ ℕ0 ∧ (-𝑦 − 1) ∈ ℕ0)) → (((bits ↾ ℕ0)‘(-𝑥 − 1)) = ((bits ↾ ℕ0)‘(-𝑦 − 1)) ↔ (-𝑥 − 1) = (-𝑦 − 1)))
5654, 55mpan 690 . . . . . . . . 9 (((-𝑥 − 1) ∈ ℕ0 ∧ (-𝑦 − 1) ∈ ℕ0) → (((bits ↾ ℕ0)‘(-𝑥 − 1)) = ((bits ↾ ℕ0)‘(-𝑦 − 1)) ↔ (-𝑥 − 1) = (-𝑦 − 1)))
5719, 49, 56syl2anc 584 . . . . . . . 8 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (((bits ↾ ℕ0)‘(-𝑥 − 1)) = ((bits ↾ ℕ0)‘(-𝑦 − 1)) ↔ (-𝑥 − 1) = (-𝑦 − 1)))
5851, 57mpbid 232 . . . . . . 7 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → (-𝑥 − 1) = (-𝑦 − 1))
598, 9, 10, 58subcan2d 11659 . . . . . 6 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → -𝑥 = -𝑦)
604, 7, 59neg11d 11629 . . . . 5 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (-𝑥 ∈ ℕ ∧ (bits‘𝑥) = (bits‘𝑦))) → 𝑥 = 𝑦)
6160expr 456 . . . 4 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ -𝑥 ∈ ℕ) → ((bits‘𝑥) = (bits‘𝑦) → 𝑥 = 𝑦))
623negnegd 11608 . . . . . . 7 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → --𝑥 = 𝑥)
6362eleq1d 2823 . . . . . 6 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (--𝑥 ∈ ℕ0𝑥 ∈ ℕ0))
6463biimpa 476 . . . . 5 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ --𝑥 ∈ ℕ0) → 𝑥 ∈ ℕ0)
65 simprr 773 . . . . . . . 8 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (bits‘𝑥) = (bits‘𝑦))
66 fvres 6925 . . . . . . . . 9 (𝑥 ∈ ℕ0 → ((bits ↾ ℕ0)‘𝑥) = (bits‘𝑥))
6766ad2antrl 728 . . . . . . . 8 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ((bits ↾ ℕ0)‘𝑥) = (bits‘𝑥))
6815ad2antlr 727 . . . . . . . . . . . . 13 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (ℕ0 ∖ (bits‘𝑦)) = (bits‘(-𝑦 − 1)))
69 bitsfi 16470 . . . . . . . . . . . . . . . 16 (𝑥 ∈ ℕ0 → (bits‘𝑥) ∈ Fin)
7069ad2antrl 728 . . . . . . . . . . . . . . 15 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (bits‘𝑥) ∈ Fin)
7165, 70eqeltrrd 2839 . . . . . . . . . . . . . 14 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (bits‘𝑦) ∈ Fin)
72 difinf 9346 . . . . . . . . . . . . . 14 ((¬ ℕ0 ∈ Fin ∧ (bits‘𝑦) ∈ Fin) → ¬ (ℕ0 ∖ (bits‘𝑦)) ∈ Fin)
7327, 71, 72sylancr 587 . . . . . . . . . . . . 13 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ (ℕ0 ∖ (bits‘𝑦)) ∈ Fin)
7468, 73eqneltrrd 2859 . . . . . . . . . . . 12 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ (bits‘(-𝑦 − 1)) ∈ Fin)
75 bitsfi 16470 . . . . . . . . . . . 12 ((-𝑦 − 1) ∈ ℕ0 → (bits‘(-𝑦 − 1)) ∈ Fin)
7674, 75nsyl 140 . . . . . . . . . . 11 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ (-𝑦 − 1) ∈ ℕ0)
7776, 48nsyl 140 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ¬ -𝑦 ∈ ℕ)
7844adantr 480 . . . . . . . . . . 11 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (-𝑦 ∈ ℕ ∨ 𝑦 ∈ ℕ0))
7978ord 864 . . . . . . . . . 10 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (¬ -𝑦 ∈ ℕ → 𝑦 ∈ ℕ0))
8077, 79mpd 15 . . . . . . . . 9 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → 𝑦 ∈ ℕ0)
8180fvresd 6926 . . . . . . . 8 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ((bits ↾ ℕ0)‘𝑦) = (bits‘𝑦))
8265, 67, 813eqtr4d 2784 . . . . . . 7 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → ((bits ↾ ℕ0)‘𝑥) = ((bits ↾ ℕ0)‘𝑦))
83 simprl 771 . . . . . . . 8 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → 𝑥 ∈ ℕ0)
84 f1fveq 7281 . . . . . . . . 9 (((bits ↾ ℕ0):ℕ01-1→(𝒫 ℕ0 ∩ Fin) ∧ (𝑥 ∈ ℕ0𝑦 ∈ ℕ0)) → (((bits ↾ ℕ0)‘𝑥) = ((bits ↾ ℕ0)‘𝑦) ↔ 𝑥 = 𝑦))
8554, 84mpan 690 . . . . . . . 8 ((𝑥 ∈ ℕ0𝑦 ∈ ℕ0) → (((bits ↾ ℕ0)‘𝑥) = ((bits ↾ ℕ0)‘𝑦) ↔ 𝑥 = 𝑦))
8683, 80, 85syl2anc 584 . . . . . . 7 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → (((bits ↾ ℕ0)‘𝑥) = ((bits ↾ ℕ0)‘𝑦) ↔ 𝑥 = 𝑦))
8782, 86mpbid 232 . . . . . 6 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑥 ∈ ℕ0 ∧ (bits‘𝑥) = (bits‘𝑦))) → 𝑥 = 𝑦)
8887expr 456 . . . . 5 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ 𝑥 ∈ ℕ0) → ((bits‘𝑥) = (bits‘𝑦) → 𝑥 = 𝑦))
8964, 88syldan 591 . . . 4 (((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ --𝑥 ∈ ℕ0) → ((bits‘𝑥) = (bits‘𝑦) → 𝑥 = 𝑦))
902znegcld 12721 . . . . 5 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → -𝑥 ∈ ℤ)
91 elznn 12626 . . . . . 6 (-𝑥 ∈ ℤ ↔ (-𝑥 ∈ ℝ ∧ (-𝑥 ∈ ℕ ∨ --𝑥 ∈ ℕ0)))
9291simprbi 496 . . . . 5 (-𝑥 ∈ ℤ → (-𝑥 ∈ ℕ ∨ --𝑥 ∈ ℕ0))
9390, 92syl 17 . . . 4 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (-𝑥 ∈ ℕ ∨ --𝑥 ∈ ℕ0))
9461, 89, 93mpjaodan 960 . . 3 ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((bits‘𝑥) = (bits‘𝑦) → 𝑥 = 𝑦))
9594rgen2 3196 . 2 𝑥 ∈ ℤ ∀𝑦 ∈ ℤ ((bits‘𝑥) = (bits‘𝑦) → 𝑥 = 𝑦)
96 dff13 7274 . 2 (bits:ℤ–1-1→𝒫 ℕ0 ↔ (bits:ℤ⟶𝒫 ℕ0 ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ ((bits‘𝑥) = (bits‘𝑦) → 𝑥 = 𝑦)))
971, 95, 96mpbir2an 711 1 bits:ℤ–1-1→𝒫 ℕ0
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847   = wceq 1536  wcel 2105  wral 3058  cdif 3959  cin 3961  𝒫 cpw 4604   class class class wbr 5147  cres 5690  wf 6558  1-1wf1 6559  1-1-ontowf1o 6561  cfv 6562  (class class class)co 7430  ωcom 7886  cen 8980  Fincfn 8983  cc 11150  cr 11151  1c1 11153  cmin 11489  -cneg 11490  cn 12263  0cn0 12523  cz 12610  bitscbits 16452
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753  ax-inf2 9678  ax-cnex 11208  ax-resscn 11209  ax-1cn 11210  ax-icn 11211  ax-addcl 11212  ax-addrcl 11213  ax-mulcl 11214  ax-mulrcl 11215  ax-mulcom 11216  ax-addass 11217  ax-mulass 11218  ax-distr 11219  ax-i2m1 11220  ax-1ne0 11221  ax-1rid 11222  ax-rnegex 11223  ax-rrecex 11224  ax-cnre 11225  ax-pre-lttri 11226  ax-pre-lttrn 11227  ax-pre-ltadd 11228  ax-pre-mulgt0 11229  ax-pre-sup 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3377  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-disj 5115  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-se 5641  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-pred 6322  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-isom 6571  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7887  df-1st 8012  df-2nd 8013  df-frecs 8304  df-wrecs 8335  df-recs 8409  df-rdg 8448  df-1o 8504  df-2o 8505  df-oadd 8508  df-er 8743  df-map 8866  df-pm 8867  df-en 8984  df-dom 8985  df-sdom 8986  df-fin 8987  df-sup 9479  df-inf 9480  df-oi 9547  df-dju 9938  df-card 9976  df-pnf 11294  df-mnf 11295  df-xr 11296  df-ltxr 11297  df-le 11298  df-sub 11491  df-neg 11492  df-div 11918  df-nn 12264  df-2 12326  df-3 12327  df-n0 12524  df-xnn0 12597  df-z 12611  df-uz 12876  df-rp 13032  df-fz 13544  df-fzo 13691  df-fl 13828  df-mod 13906  df-seq 14039  df-exp 14099  df-hash 14366  df-cj 15134  df-re 15135  df-im 15136  df-sqrt 15270  df-abs 15271  df-clim 15520  df-sum 15719  df-dvds 16287  df-bits 16455
This theorem is referenced by:  bitsuz  16507  eulerpartlemmf  34356
  Copyright terms: Public domain W3C validator