ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oddpwdclemdc GIF version

Theorem oddpwdclemdc 12105
Description: Lemma for oddpwdc 12106. Decomposing a number into odd and even parts. (Contributed by Jim Kingdon, 16-Nov-2021.)
Assertion
Ref Expression
oddpwdclemdc ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) ↔ (𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
Distinct variable groups:   𝑧,𝐴   𝑧,𝑌
Allowed substitution hint:   𝑋(𝑧)

Proof of Theorem oddpwdclemdc
StepHypRef Expression
1 simpr 109 . . . 4 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → 𝐴 = ((2↑𝑌) · 𝑋))
2 2nn 9018 . . . . . . 7 2 ∈ ℕ
32a1i 9 . . . . . 6 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → 2 ∈ ℕ)
4 simplr 520 . . . . . 6 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → 𝑌 ∈ ℕ0)
53, 4nnexpcld 10610 . . . . 5 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → (2↑𝑌) ∈ ℕ)
6 simplll 523 . . . . 5 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → 𝑋 ∈ ℕ)
75, 6nnmulcld 8906 . . . 4 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → ((2↑𝑌) · 𝑋) ∈ ℕ)
81, 7eqeltrd 2243 . . 3 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → 𝐴 ∈ ℕ)
9 oddpwdclemxy 12101 . . 3 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))
108, 9jca 304 . 2 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) → (𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
11 simpr 109 . . . . . 6 ((𝐴 ∈ ℕ ∧ 𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))) → 𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
12 oddpwdclemdvds 12102 . . . . . . . 8 (𝐴 ∈ ℕ → (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∥ 𝐴)
132a1i 9 . . . . . . . . . 10 (𝐴 ∈ ℕ → 2 ∈ ℕ)
14 pw2dvdseu 12100 . . . . . . . . . . 11 (𝐴 ∈ ℕ → ∃!𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))
15 riotacl 5812 . . . . . . . . . . 11 (∃!𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴) → (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)) ∈ ℕ0)
1614, 15syl 14 . . . . . . . . . 10 (𝐴 ∈ ℕ → (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)) ∈ ℕ0)
1713, 16nnexpcld 10610 . . . . . . . . 9 (𝐴 ∈ ℕ → (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∈ ℕ)
18 nndivdvds 11736 . . . . . . . . 9 ((𝐴 ∈ ℕ ∧ (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∈ ℕ) → ((2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∥ 𝐴 ↔ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∈ ℕ))
1917, 18mpdan 418 . . . . . . . 8 (𝐴 ∈ ℕ → ((2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∥ 𝐴 ↔ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∈ ℕ))
2012, 19mpbid 146 . . . . . . 7 (𝐴 ∈ ℕ → (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∈ ℕ)
2120adantr 274 . . . . . 6 ((𝐴 ∈ ℕ ∧ 𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))) → (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∈ ℕ)
2211, 21eqeltrd 2243 . . . . 5 ((𝐴 ∈ ℕ ∧ 𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))) → 𝑋 ∈ ℕ)
2322adantrr 471 . . . 4 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝑋 ∈ ℕ)
24 oddpwdclemodd 12104 . . . . . 6 (𝐴 ∈ ℕ → ¬ 2 ∥ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
2524adantr 274 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → ¬ 2 ∥ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
26 breq2 3986 . . . . . . 7 (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (2 ∥ 𝑋 ↔ 2 ∥ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))))
2726notbid 657 . . . . . 6 (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (¬ 2 ∥ 𝑋 ↔ ¬ 2 ∥ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))))
2827ad2antrl 482 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (¬ 2 ∥ 𝑋 ↔ ¬ 2 ∥ (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))))
2925, 28mpbird 166 . . . 4 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → ¬ 2 ∥ 𝑋)
3023, 29jca 304 . . 3 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋))
31 simprr 522 . . . 4 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))
3216adantr 274 . . . 4 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)) ∈ ℕ0)
3331, 32eqeltrd 2243 . . 3 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝑌 ∈ ℕ0)
3431oveq2d 5858 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (2↑𝑌) = (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))
3511adantrr 471 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
3634, 35oveq12d 5860 . . . 4 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → ((2↑𝑌) · 𝑋) = ((2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) · (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))))
37 simpl 108 . . . . . 6 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝐴 ∈ ℕ)
3837nncnd 8871 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝐴 ∈ ℂ)
3917adantr 274 . . . . . 6 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∈ ℕ)
4039nncnd 8871 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) ∈ ℂ)
4139nnap0d 8903 . . . . 5 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) # 0)
4238, 40, 41divcanap2d 8688 . . . 4 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → ((2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))) · (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴))))) = 𝐴)
4336, 42eqtr2d 2199 . . 3 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → 𝐴 = ((2↑𝑌) · 𝑋))
4430, 33, 43jca31 307 . 2 ((𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) → (((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)))
4510, 44impbii 125 1 ((((𝑋 ∈ ℕ ∧ ¬ 2 ∥ 𝑋) ∧ 𝑌 ∈ ℕ0) ∧ 𝐴 = ((2↑𝑌) · 𝑋)) ↔ (𝐴 ∈ ℕ ∧ (𝑋 = (𝐴 / (2↑(𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))) ∧ 𝑌 = (𝑧 ∈ ℕ0 ((2↑𝑧) ∥ 𝐴 ∧ ¬ (2↑(𝑧 + 1)) ∥ 𝐴)))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wa 103  wb 104   = wceq 1343  wcel 2136  ∃!wreu 2446   class class class wbr 3982  crio 5797  (class class class)co 5842  1c1 7754   + caddc 7756   · cmul 7758   / cdiv 8568  cn 8857  2c2 8908  0cn0 9114  cexp 10454  cdvds 11727
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871  ax-arch 7872
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-2 8916  df-n0 9115  df-z 9192  df-uz 9467  df-q 9558  df-rp 9590  df-fz 9945  df-fl 10205  df-mod 10258  df-seqfrec 10381  df-exp 10455  df-dvds 11728
This theorem is referenced by:  oddpwdc  12106
  Copyright terms: Public domain W3C validator