Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eulerpartlemgvv Structured version   Visualization version   GIF version

Theorem eulerpartlemgvv 31534
Description: Lemma for eulerpart 31540: value of the function 𝐺 evaluated. (Contributed by Thierry Arnoux, 10-Aug-2018.)
Hypotheses
Ref Expression
eulerpart.p 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁)}
eulerpart.o 𝑂 = {𝑔𝑃 ∣ ∀𝑛 ∈ (𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
eulerpart.d 𝐷 = {𝑔𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔𝑛) ≤ 1}
eulerpart.j 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
eulerpart.f 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
eulerpart.h 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑m 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
eulerpart.m 𝑀 = (𝑟𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ (𝑟𝑥))})
eulerpart.r 𝑅 = {𝑓 ∣ (𝑓 “ ℕ) ∈ Fin}
eulerpart.t 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
eulerpart.g 𝐺 = (𝑜 ∈ (𝑇𝑅) ↦ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜𝐽))))))
Assertion
Ref Expression
eulerpartlemgvv ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → ((𝐺𝐴)‘𝐵) = if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵, 1, 0))
Distinct variable groups:   𝑓,𝑘,𝑛,𝑡,𝑥,𝑦,𝑧   𝑓,𝑜,𝑟,𝐴   𝑜,𝐹   𝐻,𝑟   𝑓,𝐽   𝑛,𝑜,𝑟,𝐽,𝑥,𝑦   𝑜,𝑀   𝑓,𝑁   𝑔,𝑛,𝑃   𝑅,𝑜   𝑇,𝑜   𝑡,𝐴,𝑛,𝑥,𝑦   𝐵,𝑛,𝑡,𝑥,𝑦   𝑛,𝐹,𝑡,𝑥,𝑦   𝑡,𝐽   𝑛,𝑀,𝑡,𝑥,𝑦   𝑅,𝑛   𝑡,𝑟,𝑅,𝑥,𝑦   𝑇,𝑛,𝑟,𝑡,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑧,𝑔,𝑘)   𝐵(𝑧,𝑓,𝑔,𝑘,𝑜,𝑟)   𝐷(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑜,𝑟)   𝑃(𝑥,𝑦,𝑧,𝑡,𝑓,𝑘,𝑜,𝑟)   𝑅(𝑧,𝑓,𝑔,𝑘)   𝑇(𝑧,𝑓,𝑔,𝑘)   𝐹(𝑧,𝑓,𝑔,𝑘,𝑟)   𝐺(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑜,𝑟)   𝐻(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑜)   𝐽(𝑧,𝑔,𝑘)   𝑀(𝑧,𝑓,𝑔,𝑘,𝑟)   𝑁(𝑥,𝑦,𝑧,𝑡,𝑔,𝑘,𝑛,𝑜,𝑟)   𝑂(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑜,𝑟)

Proof of Theorem eulerpartlemgvv
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 eulerpart.p . . . . 5 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁)}
2 eulerpart.o . . . . 5 𝑂 = {𝑔𝑃 ∣ ∀𝑛 ∈ (𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
3 eulerpart.d . . . . 5 𝐷 = {𝑔𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔𝑛) ≤ 1}
4 eulerpart.j . . . . 5 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
5 eulerpart.f . . . . 5 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
6 eulerpart.h . . . . 5 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑m 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
7 eulerpart.m . . . . 5 𝑀 = (𝑟𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ (𝑟𝑥))})
8 eulerpart.r . . . . 5 𝑅 = {𝑓 ∣ (𝑓 “ ℕ) ∈ Fin}
9 eulerpart.t . . . . 5 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
10 eulerpart.g . . . . 5 𝐺 = (𝑜 ∈ (𝑇𝑅) ↦ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜𝐽))))))
111, 2, 3, 4, 5, 6, 7, 8, 9, 10eulerpartlemgv 31531 . . . 4 (𝐴 ∈ (𝑇𝑅) → (𝐺𝐴) = ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽))))))
1211fveq1d 6666 . . 3 (𝐴 ∈ (𝑇𝑅) → ((𝐺𝐴)‘𝐵) = (((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))))‘𝐵))
1312adantr 481 . 2 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → ((𝐺𝐴)‘𝐵) = (((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))))‘𝐵))
14 nnex 11633 . . 3 ℕ ∈ V
15 imassrn 5934 . . . 4 (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))) ⊆ ran 𝐹
164, 5oddpwdc 31512 . . . . 5 𝐹:(𝐽 × ℕ0)–1-1-onto→ℕ
17 f1of 6609 . . . . 5 (𝐹:(𝐽 × ℕ0)–1-1-onto→ℕ → 𝐹:(𝐽 × ℕ0)⟶ℕ)
18 frn 6514 . . . . 5 (𝐹:(𝐽 × ℕ0)⟶ℕ → ran 𝐹 ⊆ ℕ)
1916, 17, 18mp2b 10 . . . 4 ran 𝐹 ⊆ ℕ
2015, 19sstri 3975 . . 3 (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))) ⊆ ℕ
21 simpr 485 . . 3 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℕ)
22 indfval 31175 . . 3 ((ℕ ∈ V ∧ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))) ⊆ ℕ ∧ 𝐵 ∈ ℕ) → (((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))))‘𝐵) = if(𝐵 ∈ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))), 1, 0))
2314, 20, 21, 22mp3an12i 1456 . 2 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → (((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))))‘𝐵) = if(𝐵 ∈ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))), 1, 0))
24 ffn 6508 . . . . . 6 (𝐹:(𝐽 × ℕ0)⟶ℕ → 𝐹 Fn (𝐽 × ℕ0))
2516, 17, 24mp2b 10 . . . . 5 𝐹 Fn (𝐽 × ℕ0)
261, 2, 3, 4, 5, 6, 7, 8, 9, 10eulerpartlemmf 31533 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (bits ∘ (𝐴𝐽)) ∈ 𝐻)
271, 2, 3, 4, 5, 6, 7eulerpartlem1 31525 . . . . . . . . . . 11 𝑀:𝐻1-1-onto→(𝒫 (𝐽 × ℕ0) ∩ Fin)
28 f1of 6609 . . . . . . . . . . 11 (𝑀:𝐻1-1-onto→(𝒫 (𝐽 × ℕ0) ∩ Fin) → 𝑀:𝐻⟶(𝒫 (𝐽 × ℕ0) ∩ Fin))
2927, 28ax-mp 5 . . . . . . . . . 10 𝑀:𝐻⟶(𝒫 (𝐽 × ℕ0) ∩ Fin)
3029ffvelrni 6843 . . . . . . . . 9 ((bits ∘ (𝐴𝐽)) ∈ 𝐻 → (𝑀‘(bits ∘ (𝐴𝐽))) ∈ (𝒫 (𝐽 × ℕ0) ∩ Fin))
3126, 30syl 17 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → (𝑀‘(bits ∘ (𝐴𝐽))) ∈ (𝒫 (𝐽 × ℕ0) ∩ Fin))
3231elin1d 4174 . . . . . . 7 (𝐴 ∈ (𝑇𝑅) → (𝑀‘(bits ∘ (𝐴𝐽))) ∈ 𝒫 (𝐽 × ℕ0))
3332adantr 481 . . . . . 6 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → (𝑀‘(bits ∘ (𝐴𝐽))) ∈ 𝒫 (𝐽 × ℕ0))
3433elpwid 4551 . . . . 5 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → (𝑀‘(bits ∘ (𝐴𝐽))) ⊆ (𝐽 × ℕ0))
35 fvelimab 6731 . . . . 5 ((𝐹 Fn (𝐽 × ℕ0) ∧ (𝑀‘(bits ∘ (𝐴𝐽))) ⊆ (𝐽 × ℕ0)) → (𝐵 ∈ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))) ↔ ∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵))
3625, 34, 35sylancr 587 . . . 4 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → (𝐵 ∈ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))) ↔ ∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵))
374ssrab3 4056 . . . . . . . . 9 𝐽 ⊆ ℕ
38 fveq1 6663 . . . . . . . . . . . . . . . . . . 19 (𝑟 = (bits ∘ (𝐴𝐽)) → (𝑟𝑥) = ((bits ∘ (𝐴𝐽))‘𝑥))
3938eleq2d 2898 . . . . . . . . . . . . . . . . . 18 (𝑟 = (bits ∘ (𝐴𝐽)) → (𝑦 ∈ (𝑟𝑥) ↔ 𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥)))
4039anbi2d 628 . . . . . . . . . . . . . . . . 17 (𝑟 = (bits ∘ (𝐴𝐽)) → ((𝑥𝐽𝑦 ∈ (𝑟𝑥)) ↔ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))))
4140opabbidv 5124 . . . . . . . . . . . . . . . 16 (𝑟 = (bits ∘ (𝐴𝐽)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ (𝑟𝑥))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))})
4214, 37ssexi 5218 . . . . . . . . . . . . . . . . . 18 𝐽 ∈ V
43 abid2 2957 . . . . . . . . . . . . . . . . . . . 20 {𝑦𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥)} = ((bits ∘ (𝐴𝐽))‘𝑥)
4443fvexi 6678 . . . . . . . . . . . . . . . . . . 19 {𝑦𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥)} ∈ V
4544a1i 11 . . . . . . . . . . . . . . . . . 18 (𝑥𝐽 → {𝑦𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥)} ∈ V)
4642, 45opabex3 7659 . . . . . . . . . . . . . . . . 17 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))} ∈ V
4746a1i 11 . . . . . . . . . . . . . . . 16 (𝐴 ∈ (𝑇𝑅) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))} ∈ V)
487, 41, 26, 47fvmptd3 6784 . . . . . . . . . . . . . . 15 (𝐴 ∈ (𝑇𝑅) → (𝑀‘(bits ∘ (𝐴𝐽))) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))})
49 simpl 483 . . . . . . . . . . . . . . . . . 18 ((𝑥 = 𝑡𝑦 = 𝑛) → 𝑥 = 𝑡)
5049eleq1d 2897 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑡𝑦 = 𝑛) → (𝑥𝐽𝑡𝐽))
51 simpr 485 . . . . . . . . . . . . . . . . . 18 ((𝑥 = 𝑡𝑦 = 𝑛) → 𝑦 = 𝑛)
5249fveq2d 6668 . . . . . . . . . . . . . . . . . 18 ((𝑥 = 𝑡𝑦 = 𝑛) → ((bits ∘ (𝐴𝐽))‘𝑥) = ((bits ∘ (𝐴𝐽))‘𝑡))
5351, 52eleq12d 2907 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑡𝑦 = 𝑛) → (𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥) ↔ 𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡)))
5450, 53anbi12d 630 . . . . . . . . . . . . . . . 16 ((𝑥 = 𝑡𝑦 = 𝑛) → ((𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥)) ↔ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))))
5554cbvopabv 5130 . . . . . . . . . . . . . . 15 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))} = {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))}
5648, 55syl6eq 2872 . . . . . . . . . . . . . 14 (𝐴 ∈ (𝑇𝑅) → (𝑀‘(bits ∘ (𝐴𝐽))) = {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))})
5756eleq2d 2898 . . . . . . . . . . . . 13 (𝐴 ∈ (𝑇𝑅) → (𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽))) ↔ 𝑤 ∈ {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))}))
581, 2, 3, 4, 5, 6, 7, 8, 9eulerpartlemt0 31527 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 ∈ (𝑇𝑅) ↔ (𝐴 ∈ (ℕ0m ℕ) ∧ (𝐴 “ ℕ) ∈ Fin ∧ (𝐴 “ ℕ) ⊆ 𝐽))
5958simp1bi 1137 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴 ∈ (𝑇𝑅) → 𝐴 ∈ (ℕ0m ℕ))
60 nn0ex 11892 . . . . . . . . . . . . . . . . . . . . . . . 24 0 ∈ V
6160, 14elmap 8425 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴 ∈ (ℕ0m ℕ) ↔ 𝐴:ℕ⟶ℕ0)
6259, 61sylib 219 . . . . . . . . . . . . . . . . . . . . . 22 (𝐴 ∈ (𝑇𝑅) → 𝐴:ℕ⟶ℕ0)
63 ffun 6511 . . . . . . . . . . . . . . . . . . . . . 22 (𝐴:ℕ⟶ℕ0 → Fun 𝐴)
64 funres 6391 . . . . . . . . . . . . . . . . . . . . . 22 (Fun 𝐴 → Fun (𝐴𝐽))
6562, 63, 643syl 18 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 ∈ (𝑇𝑅) → Fun (𝐴𝐽))
66 fssres 6538 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝐴:ℕ⟶ℕ0𝐽 ⊆ ℕ) → (𝐴𝐽):𝐽⟶ℕ0)
6762, 37, 66sylancl 586 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴 ∈ (𝑇𝑅) → (𝐴𝐽):𝐽⟶ℕ0)
68 fdm 6516 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝐴𝐽):𝐽⟶ℕ0 → dom (𝐴𝐽) = 𝐽)
6968eleq2d 2898 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝐴𝐽):𝐽⟶ℕ0 → (𝑡 ∈ dom (𝐴𝐽) ↔ 𝑡𝐽))
7067, 69syl 17 . . . . . . . . . . . . . . . . . . . . . 22 (𝐴 ∈ (𝑇𝑅) → (𝑡 ∈ dom (𝐴𝐽) ↔ 𝑡𝐽))
7170biimpar 478 . . . . . . . . . . . . . . . . . . . . 21 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡𝐽) → 𝑡 ∈ dom (𝐴𝐽))
72 fvco 6753 . . . . . . . . . . . . . . . . . . . . 21 ((Fun (𝐴𝐽) ∧ 𝑡 ∈ dom (𝐴𝐽)) → ((bits ∘ (𝐴𝐽))‘𝑡) = (bits‘((𝐴𝐽)‘𝑡)))
7365, 71, 72syl2an2r 681 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡𝐽) → ((bits ∘ (𝐴𝐽))‘𝑡) = (bits‘((𝐴𝐽)‘𝑡)))
74 fvres 6683 . . . . . . . . . . . . . . . . . . . . . 22 (𝑡𝐽 → ((𝐴𝐽)‘𝑡) = (𝐴𝑡))
7574fveq2d 6668 . . . . . . . . . . . . . . . . . . . . 21 (𝑡𝐽 → (bits‘((𝐴𝐽)‘𝑡)) = (bits‘(𝐴𝑡)))
7675adantl 482 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡𝐽) → (bits‘((𝐴𝐽)‘𝑡)) = (bits‘(𝐴𝑡)))
7773, 76eqtrd 2856 . . . . . . . . . . . . . . . . . . 19 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡𝐽) → ((bits ∘ (𝐴𝐽))‘𝑡) = (bits‘(𝐴𝑡)))
7877eleq2d 2898 . . . . . . . . . . . . . . . . . 18 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡𝐽) → (𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡) ↔ 𝑛 ∈ (bits‘(𝐴𝑡))))
7978pm5.32da 579 . . . . . . . . . . . . . . . . 17 (𝐴 ∈ (𝑇𝑅) → ((𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡)) ↔ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))))
8079opabbidv 5124 . . . . . . . . . . . . . . . 16 (𝐴 ∈ (𝑇𝑅) → {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))} = {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))})
8180eleq2d 2898 . . . . . . . . . . . . . . 15 (𝐴 ∈ (𝑇𝑅) → (𝑤 ∈ {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))} ↔ 𝑤 ∈ {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))}))
82 elopab 5406 . . . . . . . . . . . . . . 15 (𝑤 ∈ {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))} ↔ ∃𝑡𝑛(𝑤 = ⟨𝑡, 𝑛⟩ ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))))
8381, 82syl6bb 288 . . . . . . . . . . . . . 14 (𝐴 ∈ (𝑇𝑅) → (𝑤 ∈ {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))} ↔ ∃𝑡𝑛(𝑤 = ⟨𝑡, 𝑛⟩ ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))))))
84 ancom 461 . . . . . . . . . . . . . . . . 17 ((𝑤 = ⟨𝑡, 𝑛⟩ ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ↔ ((𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))) ∧ 𝑤 = ⟨𝑡, 𝑛⟩))
85 anass 469 . . . . . . . . . . . . . . . . 17 (((𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))) ∧ 𝑤 = ⟨𝑡, 𝑛⟩) ↔ (𝑡𝐽 ∧ (𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
8684, 85bitri 276 . . . . . . . . . . . . . . . 16 ((𝑤 = ⟨𝑡, 𝑛⟩ ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ↔ (𝑡𝐽 ∧ (𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
87862exbii 1840 . . . . . . . . . . . . . . 15 (∃𝑡𝑛(𝑤 = ⟨𝑡, 𝑛⟩ ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ↔ ∃𝑡𝑛(𝑡𝐽 ∧ (𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
88 df-rex 3144 . . . . . . . . . . . . . . . . . 18 (∃𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩ ↔ ∃𝑛(𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩))
8988anbi2i 622 . . . . . . . . . . . . . . . . 17 ((𝑡𝐽 ∧ ∃𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩) ↔ (𝑡𝐽 ∧ ∃𝑛(𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
9089exbii 1839 . . . . . . . . . . . . . . . 16 (∃𝑡(𝑡𝐽 ∧ ∃𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩) ↔ ∃𝑡(𝑡𝐽 ∧ ∃𝑛(𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
91 df-rex 3144 . . . . . . . . . . . . . . . 16 (∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩ ↔ ∃𝑡(𝑡𝐽 ∧ ∃𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩))
92 exdistr 1946 . . . . . . . . . . . . . . . 16 (∃𝑡𝑛(𝑡𝐽 ∧ (𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)) ↔ ∃𝑡(𝑡𝐽 ∧ ∃𝑛(𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
9390, 91, 923bitr4i 304 . . . . . . . . . . . . . . 15 (∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩ ↔ ∃𝑡𝑛(𝑡𝐽 ∧ (𝑛 ∈ (bits‘(𝐴𝑡)) ∧ 𝑤 = ⟨𝑡, 𝑛⟩)))
9487, 93bitr4i 279 . . . . . . . . . . . . . 14 (∃𝑡𝑛(𝑤 = ⟨𝑡, 𝑛⟩ ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ↔ ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩)
9583, 94syl6bb 288 . . . . . . . . . . . . 13 (𝐴 ∈ (𝑇𝑅) → (𝑤 ∈ {⟨𝑡, 𝑛⟩ ∣ (𝑡𝐽𝑛 ∈ ((bits ∘ (𝐴𝐽))‘𝑡))} ↔ ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩))
9657, 95bitrd 280 . . . . . . . . . . . 12 (𝐴 ∈ (𝑇𝑅) → (𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽))) ↔ ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩))
9796biimpa 477 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) → ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩)
9897adantlr 711 . . . . . . . . . 10 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) → ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩)
99 fveq2 6664 . . . . . . . . . . . . . 14 (𝑤 = ⟨𝑡, 𝑛⟩ → (𝐹𝑤) = (𝐹‘⟨𝑡, 𝑛⟩))
10099adantl 482 . . . . . . . . . . . . 13 (((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ∧ 𝑤 = ⟨𝑡, 𝑛⟩) → (𝐹𝑤) = (𝐹‘⟨𝑡, 𝑛⟩))
101 bitsss 15765 . . . . . . . . . . . . . . . . 17 (bits‘(𝐴𝑡)) ⊆ ℕ0
102101sseli 3962 . . . . . . . . . . . . . . . 16 (𝑛 ∈ (bits‘(𝐴𝑡)) → 𝑛 ∈ ℕ0)
103102anim2i 616 . . . . . . . . . . . . . . 15 ((𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))) → (𝑡𝐽𝑛 ∈ ℕ0))
104103ad2antlr 723 . . . . . . . . . . . . . 14 (((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ∧ 𝑤 = ⟨𝑡, 𝑛⟩) → (𝑡𝐽𝑛 ∈ ℕ0))
105 opelxp 5585 . . . . . . . . . . . . . . 15 (⟨𝑡, 𝑛⟩ ∈ (𝐽 × ℕ0) ↔ (𝑡𝐽𝑛 ∈ ℕ0))
1064, 5oddpwdcv 31513 . . . . . . . . . . . . . . . 16 (⟨𝑡, 𝑛⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑡, 𝑛⟩) = ((2↑(2nd ‘⟨𝑡, 𝑛⟩)) · (1st ‘⟨𝑡, 𝑛⟩)))
107 vex 3498 . . . . . . . . . . . . . . . . . . 19 𝑡 ∈ V
108 vex 3498 . . . . . . . . . . . . . . . . . . 19 𝑛 ∈ V
109107, 108op2nd 7689 . . . . . . . . . . . . . . . . . 18 (2nd ‘⟨𝑡, 𝑛⟩) = 𝑛
110109oveq2i 7156 . . . . . . . . . . . . . . . . 17 (2↑(2nd ‘⟨𝑡, 𝑛⟩)) = (2↑𝑛)
111107, 108op1st 7688 . . . . . . . . . . . . . . . . 17 (1st ‘⟨𝑡, 𝑛⟩) = 𝑡
112110, 111oveq12i 7157 . . . . . . . . . . . . . . . 16 ((2↑(2nd ‘⟨𝑡, 𝑛⟩)) · (1st ‘⟨𝑡, 𝑛⟩)) = ((2↑𝑛) · 𝑡)
113106, 112syl6eq 2872 . . . . . . . . . . . . . . 15 (⟨𝑡, 𝑛⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑡, 𝑛⟩) = ((2↑𝑛) · 𝑡))
114105, 113sylbir 236 . . . . . . . . . . . . . 14 ((𝑡𝐽𝑛 ∈ ℕ0) → (𝐹‘⟨𝑡, 𝑛⟩) = ((2↑𝑛) · 𝑡))
115104, 114syl 17 . . . . . . . . . . . . 13 (((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ∧ 𝑤 = ⟨𝑡, 𝑛⟩) → (𝐹‘⟨𝑡, 𝑛⟩) = ((2↑𝑛) · 𝑡))
116100, 115eqtr2d 2857 . . . . . . . . . . . 12 (((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) ∧ 𝑤 = ⟨𝑡, 𝑛⟩) → ((2↑𝑛) · 𝑡) = (𝐹𝑤))
117116ex 413 . . . . . . . . . . 11 ((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡)))) → (𝑤 = ⟨𝑡, 𝑛⟩ → ((2↑𝑛) · 𝑡) = (𝐹𝑤)))
118117reximdvva 3277 . . . . . . . . . 10 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) → (∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))𝑤 = ⟨𝑡, 𝑛⟩ → ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤)))
11998, 118mpd 15 . . . . . . . . 9 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) → ∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤))
120 ssrexv 4033 . . . . . . . . 9 (𝐽 ⊆ ℕ → (∃𝑡𝐽𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤) → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤)))
12137, 119, 120mpsyl 68 . . . . . . . 8 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤))
122121adantr 481 . . . . . . 7 ((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝐹𝑤) = 𝐵) → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤))
123 eqeq2 2833 . . . . . . . . . 10 ((𝐹𝑤) = 𝐵 → (((2↑𝑛) · 𝑡) = (𝐹𝑤) ↔ ((2↑𝑛) · 𝑡) = 𝐵))
124123rexbidv 3297 . . . . . . . . 9 ((𝐹𝑤) = 𝐵 → (∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤) ↔ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵))
125124adantl 482 . . . . . . . 8 ((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝐹𝑤) = 𝐵) → (∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤) ↔ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵))
126125rexbidv 3297 . . . . . . 7 ((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝐹𝑤) = 𝐵) → (∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = (𝐹𝑤) ↔ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵))
127122, 126mpbid 233 . . . . . 6 ((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ 𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))) ∧ (𝐹𝑤) = 𝐵) → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵)
128127r19.29an 3288 . . . . 5 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵) → ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵)
129 simp-5l 781 . . . . . . . 8 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → 𝐴 ∈ (𝑇𝑅))
130 simpllr 772 . . . . . . . 8 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → 𝑥𝐽)
131 simplr 765 . . . . . . . . 9 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → 𝑦 ∈ (bits‘(𝐴𝑥)))
13268eleq2d 2898 . . . . . . . . . . . . . 14 ((𝐴𝐽):𝐽⟶ℕ0 → (𝑥 ∈ dom (𝐴𝐽) ↔ 𝑥𝐽))
13367, 132syl 17 . . . . . . . . . . . . 13 (𝐴 ∈ (𝑇𝑅) → (𝑥 ∈ dom (𝐴𝐽) ↔ 𝑥𝐽))
134133biimpar 478 . . . . . . . . . . . 12 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑥𝐽) → 𝑥 ∈ dom (𝐴𝐽))
135 fvco 6753 . . . . . . . . . . . 12 ((Fun (𝐴𝐽) ∧ 𝑥 ∈ dom (𝐴𝐽)) → ((bits ∘ (𝐴𝐽))‘𝑥) = (bits‘((𝐴𝐽)‘𝑥)))
13665, 134, 135syl2an2r 681 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑥𝐽) → ((bits ∘ (𝐴𝐽))‘𝑥) = (bits‘((𝐴𝐽)‘𝑥)))
137 fvres 6683 . . . . . . . . . . . . 13 (𝑥𝐽 → ((𝐴𝐽)‘𝑥) = (𝐴𝑥))
138137fveq2d 6668 . . . . . . . . . . . 12 (𝑥𝐽 → (bits‘((𝐴𝐽)‘𝑥)) = (bits‘(𝐴𝑥)))
139138adantl 482 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑥𝐽) → (bits‘((𝐴𝐽)‘𝑥)) = (bits‘(𝐴𝑥)))
140136, 139eqtrd 2856 . . . . . . . . . 10 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑥𝐽) → ((bits ∘ (𝐴𝐽))‘𝑥) = (bits‘(𝐴𝑥)))
141129, 130, 140syl2anc 584 . . . . . . . . 9 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → ((bits ∘ (𝐴𝐽))‘𝑥) = (bits‘(𝐴𝑥)))
142131, 141eleqtrrd 2916 . . . . . . . 8 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → 𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))
14348eleq2d 2898 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) → (⟨𝑥, 𝑦⟩ ∈ (𝑀‘(bits ∘ (𝐴𝐽))) ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))}))
144 opabidw 5404 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))} ↔ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥)))
145143, 144syl6bb 288 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (⟨𝑥, 𝑦⟩ ∈ (𝑀‘(bits ∘ (𝐴𝐽))) ↔ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))))
146145biimpar 478 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑥𝐽𝑦 ∈ ((bits ∘ (𝐴𝐽))‘𝑥))) → ⟨𝑥, 𝑦⟩ ∈ (𝑀‘(bits ∘ (𝐴𝐽))))
147129, 130, 142, 146syl12anc 832 . . . . . . 7 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑀‘(bits ∘ (𝐴𝐽))))
148 simpr 485 . . . . . . . 8 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → ((2↑𝑦) · 𝑥) = 𝐵)
14934ad4antr 728 . . . . . . . . 9 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → (𝑀‘(bits ∘ (𝐴𝐽))) ⊆ (𝐽 × ℕ0))
150149, 147sseldd 3967 . . . . . . . 8 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝐽 × ℕ0))
151 opeq1 4797 . . . . . . . . . . . 12 (𝑡 = 𝑥 → ⟨𝑡, 𝑦⟩ = ⟨𝑥, 𝑦⟩)
152151eleq1d 2897 . . . . . . . . . . 11 (𝑡 = 𝑥 → (⟨𝑡, 𝑦⟩ ∈ (𝐽 × ℕ0) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐽 × ℕ0)))
153151fveq2d 6668 . . . . . . . . . . . 12 (𝑡 = 𝑥 → (𝐹‘⟨𝑡, 𝑦⟩) = (𝐹‘⟨𝑥, 𝑦⟩))
154 oveq2 7153 . . . . . . . . . . . 12 (𝑡 = 𝑥 → ((2↑𝑦) · 𝑡) = ((2↑𝑦) · 𝑥))
155153, 154eqeq12d 2837 . . . . . . . . . . 11 (𝑡 = 𝑥 → ((𝐹‘⟨𝑡, 𝑦⟩) = ((2↑𝑦) · 𝑡) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = ((2↑𝑦) · 𝑥)))
156152, 155imbi12d 346 . . . . . . . . . 10 (𝑡 = 𝑥 → ((⟨𝑡, 𝑦⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑡, 𝑦⟩) = ((2↑𝑦) · 𝑡)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑥, 𝑦⟩) = ((2↑𝑦) · 𝑥))))
157 opeq2 4798 . . . . . . . . . . . . 13 (𝑛 = 𝑦 → ⟨𝑡, 𝑛⟩ = ⟨𝑡, 𝑦⟩)
158157eleq1d 2897 . . . . . . . . . . . 12 (𝑛 = 𝑦 → (⟨𝑡, 𝑛⟩ ∈ (𝐽 × ℕ0) ↔ ⟨𝑡, 𝑦⟩ ∈ (𝐽 × ℕ0)))
159157fveq2d 6668 . . . . . . . . . . . . 13 (𝑛 = 𝑦 → (𝐹‘⟨𝑡, 𝑛⟩) = (𝐹‘⟨𝑡, 𝑦⟩))
160 oveq2 7153 . . . . . . . . . . . . . 14 (𝑛 = 𝑦 → (2↑𝑛) = (2↑𝑦))
161160oveq1d 7160 . . . . . . . . . . . . 13 (𝑛 = 𝑦 → ((2↑𝑛) · 𝑡) = ((2↑𝑦) · 𝑡))
162159, 161eqeq12d 2837 . . . . . . . . . . . 12 (𝑛 = 𝑦 → ((𝐹‘⟨𝑡, 𝑛⟩) = ((2↑𝑛) · 𝑡) ↔ (𝐹‘⟨𝑡, 𝑦⟩) = ((2↑𝑦) · 𝑡)))
163158, 162imbi12d 346 . . . . . . . . . . 11 (𝑛 = 𝑦 → ((⟨𝑡, 𝑛⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑡, 𝑛⟩) = ((2↑𝑛) · 𝑡)) ↔ (⟨𝑡, 𝑦⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑡, 𝑦⟩) = ((2↑𝑦) · 𝑡))))
164163, 113chvarvv 1996 . . . . . . . . . 10 (⟨𝑡, 𝑦⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑡, 𝑦⟩) = ((2↑𝑦) · 𝑡))
165156, 164chvarvv 1996 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐽 × ℕ0) → (𝐹‘⟨𝑥, 𝑦⟩) = ((2↑𝑦) · 𝑥))
166 eqeq2 2833 . . . . . . . . . 10 (((2↑𝑦) · 𝑥) = 𝐵 → ((𝐹‘⟨𝑥, 𝑦⟩) = ((2↑𝑦) · 𝑥) ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝐵))
167166biimpa 477 . . . . . . . . 9 ((((2↑𝑦) · 𝑥) = 𝐵 ∧ (𝐹‘⟨𝑥, 𝑦⟩) = ((2↑𝑦) · 𝑥)) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐵)
168165, 167sylan2 592 . . . . . . . 8 ((((2↑𝑦) · 𝑥) = 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐽 × ℕ0)) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐵)
169148, 150, 168syl2anc 584 . . . . . . 7 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐵)
170 fveqeq2 6673 . . . . . . . 8 (𝑤 = ⟨𝑥, 𝑦⟩ → ((𝐹𝑤) = 𝐵 ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝐵))
171170rspcev 3622 . . . . . . 7 ((⟨𝑥, 𝑦⟩ ∈ (𝑀‘(bits ∘ (𝐴𝐽))) ∧ (𝐹‘⟨𝑥, 𝑦⟩) = 𝐵) → ∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵)
172147, 169, 171syl2anc 584 . . . . . 6 ((((((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) ∧ 𝑥𝐽) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → ∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵)
173 oveq2 7153 . . . . . . . . . . 11 (𝑡 = 𝑥 → ((2↑𝑛) · 𝑡) = ((2↑𝑛) · 𝑥))
174173eqeq1d 2823 . . . . . . . . . 10 (𝑡 = 𝑥 → (((2↑𝑛) · 𝑡) = 𝐵 ↔ ((2↑𝑛) · 𝑥) = 𝐵))
175160oveq1d 7160 . . . . . . . . . . 11 (𝑛 = 𝑦 → ((2↑𝑛) · 𝑥) = ((2↑𝑦) · 𝑥))
176175eqeq1d 2823 . . . . . . . . . 10 (𝑛 = 𝑦 → (((2↑𝑛) · 𝑥) = 𝐵 ↔ ((2↑𝑦) · 𝑥) = 𝐵))
177174, 176sylan9bb 510 . . . . . . . . 9 ((𝑡 = 𝑥𝑛 = 𝑦) → (((2↑𝑛) · 𝑡) = 𝐵 ↔ ((2↑𝑦) · 𝑥) = 𝐵))
178 simpl 483 . . . . . . . . . . 11 ((𝑡 = 𝑥𝑛 = 𝑦) → 𝑡 = 𝑥)
179178fveq2d 6668 . . . . . . . . . 10 ((𝑡 = 𝑥𝑛 = 𝑦) → (𝐴𝑡) = (𝐴𝑥))
180179fveq2d 6668 . . . . . . . . 9 ((𝑡 = 𝑥𝑛 = 𝑦) → (bits‘(𝐴𝑡)) = (bits‘(𝐴𝑥)))
181177, 180cbvrexdva2 3458 . . . . . . . 8 (𝑡 = 𝑥 → (∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵 ↔ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵))
182181cbvrexvw 3451 . . . . . . 7 (∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵 ↔ ∃𝑥 ∈ ℕ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)
183 nfv 1906 . . . . . . . . . . . . . 14 𝑦 𝐴 ∈ (𝑇𝑅)
184 nfv 1906 . . . . . . . . . . . . . . 15 𝑦 𝑥 ∈ ℕ
185 nfre1 3306 . . . . . . . . . . . . . . 15 𝑦𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵
186184, 185nfan 1891 . . . . . . . . . . . . . 14 𝑦(𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)
187183, 186nfan 1891 . . . . . . . . . . . . 13 𝑦(𝐴 ∈ (𝑇𝑅) ∧ (𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵))
188 simplr 765 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → 𝑥 ∈ ℕ)
18962ffvelrnda 6844 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) → (𝐴𝑥) ∈ ℕ0)
190189adantr 481 . . . . . . . . . . . . . . . . . . 19 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → (𝐴𝑥) ∈ ℕ0)
191 elnn0 11888 . . . . . . . . . . . . . . . . . . 19 ((𝐴𝑥) ∈ ℕ0 ↔ ((𝐴𝑥) ∈ ℕ ∨ (𝐴𝑥) = 0))
192190, 191sylib 219 . . . . . . . . . . . . . . . . . 18 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → ((𝐴𝑥) ∈ ℕ ∨ (𝐴𝑥) = 0))
193 n0i 4298 . . . . . . . . . . . . . . . . . . . 20 (𝑦 ∈ (bits‘(𝐴𝑥)) → ¬ (bits‘(𝐴𝑥)) = ∅)
194193adantl 482 . . . . . . . . . . . . . . . . . . 19 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → ¬ (bits‘(𝐴𝑥)) = ∅)
195 fveq2 6664 . . . . . . . . . . . . . . . . . . . 20 ((𝐴𝑥) = 0 → (bits‘(𝐴𝑥)) = (bits‘0))
196 0bits 15778 . . . . . . . . . . . . . . . . . . . 20 (bits‘0) = ∅
197195, 196syl6eq 2872 . . . . . . . . . . . . . . . . . . 19 ((𝐴𝑥) = 0 → (bits‘(𝐴𝑥)) = ∅)
198194, 197nsyl 142 . . . . . . . . . . . . . . . . . 18 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → ¬ (𝐴𝑥) = 0)
199192, 198unitresl 866 . . . . . . . . . . . . . . . . 17 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → (𝐴𝑥) ∈ ℕ)
20058simp3bi 1139 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 ∈ (𝑇𝑅) → (𝐴 “ ℕ) ⊆ 𝐽)
201200sselda 3966 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑛 ∈ (𝐴 “ ℕ)) → 𝑛𝐽)
202 breq2 5062 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑧 = 𝑛 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑛))
203202notbid 319 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑧 = 𝑛 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑛))
204203, 4elrab2 3682 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑛𝐽 ↔ (𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
205204simprbi 497 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛𝐽 → ¬ 2 ∥ 𝑛)
206201, 205syl 17 . . . . . . . . . . . . . . . . . . . . . 22 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑛 ∈ (𝐴 “ ℕ)) → ¬ 2 ∥ 𝑛)
207206ralrimiva 3182 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 ∈ (𝑇𝑅) → ∀𝑛 ∈ (𝐴 “ ℕ) ¬ 2 ∥ 𝑛)
208 ffn 6508 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝐴:ℕ⟶ℕ0𝐴 Fn ℕ)
209 elpreima 6821 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝐴 Fn ℕ → (𝑛 ∈ (𝐴 “ ℕ) ↔ (𝑛 ∈ ℕ ∧ (𝐴𝑛) ∈ ℕ)))
21062, 208, 2093syl 18 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 ∈ (𝑇𝑅) → (𝑛 ∈ (𝐴 “ ℕ) ↔ (𝑛 ∈ ℕ ∧ (𝐴𝑛) ∈ ℕ)))
211210imbi1d 343 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴 ∈ (𝑇𝑅) → ((𝑛 ∈ (𝐴 “ ℕ) → ¬ 2 ∥ 𝑛) ↔ ((𝑛 ∈ ℕ ∧ (𝐴𝑛) ∈ ℕ) → ¬ 2 ∥ 𝑛)))
212 impexp 451 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝑛 ∈ ℕ ∧ (𝐴𝑛) ∈ ℕ) → ¬ 2 ∥ 𝑛) ↔ (𝑛 ∈ ℕ → ((𝐴𝑛) ∈ ℕ → ¬ 2 ∥ 𝑛)))
213211, 212syl6bb 288 . . . . . . . . . . . . . . . . . . . . . 22 (𝐴 ∈ (𝑇𝑅) → ((𝑛 ∈ (𝐴 “ ℕ) → ¬ 2 ∥ 𝑛) ↔ (𝑛 ∈ ℕ → ((𝐴𝑛) ∈ ℕ → ¬ 2 ∥ 𝑛))))
214213ralbidv2 3195 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 ∈ (𝑇𝑅) → (∀𝑛 ∈ (𝐴 “ ℕ) ¬ 2 ∥ 𝑛 ↔ ∀𝑛 ∈ ℕ ((𝐴𝑛) ∈ ℕ → ¬ 2 ∥ 𝑛)))
215207, 214mpbid 233 . . . . . . . . . . . . . . . . . . . 20 (𝐴 ∈ (𝑇𝑅) → ∀𝑛 ∈ ℕ ((𝐴𝑛) ∈ ℕ → ¬ 2 ∥ 𝑛))
216 fveq2 6664 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑥 = 𝑛 → (𝐴𝑥) = (𝐴𝑛))
217216eleq1d 2897 . . . . . . . . . . . . . . . . . . . . . 22 (𝑥 = 𝑛 → ((𝐴𝑥) ∈ ℕ ↔ (𝐴𝑛) ∈ ℕ))
218 breq2 5062 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑥 = 𝑛 → (2 ∥ 𝑥 ↔ 2 ∥ 𝑛))
219218notbid 319 . . . . . . . . . . . . . . . . . . . . . 22 (𝑥 = 𝑛 → (¬ 2 ∥ 𝑥 ↔ ¬ 2 ∥ 𝑛))
220217, 219imbi12d 346 . . . . . . . . . . . . . . . . . . . . 21 (𝑥 = 𝑛 → (((𝐴𝑥) ∈ ℕ → ¬ 2 ∥ 𝑥) ↔ ((𝐴𝑛) ∈ ℕ → ¬ 2 ∥ 𝑛)))
221220cbvralvw 3450 . . . . . . . . . . . . . . . . . . . 20 (∀𝑥 ∈ ℕ ((𝐴𝑥) ∈ ℕ → ¬ 2 ∥ 𝑥) ↔ ∀𝑛 ∈ ℕ ((𝐴𝑛) ∈ ℕ → ¬ 2 ∥ 𝑛))
222215, 221sylibr 235 . . . . . . . . . . . . . . . . . . 19 (𝐴 ∈ (𝑇𝑅) → ∀𝑥 ∈ ℕ ((𝐴𝑥) ∈ ℕ → ¬ 2 ∥ 𝑥))
223222r19.21bi 3208 . . . . . . . . . . . . . . . . . 18 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) → ((𝐴𝑥) ∈ ℕ → ¬ 2 ∥ 𝑥))
224223imp 407 . . . . . . . . . . . . . . . . 17 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ (𝐴𝑥) ∈ ℕ) → ¬ 2 ∥ 𝑥)
225199, 224syldan 591 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → ¬ 2 ∥ 𝑥)
226 breq2 5062 . . . . . . . . . . . . . . . . . 18 (𝑧 = 𝑥 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑥))
227226notbid 319 . . . . . . . . . . . . . . . . 17 (𝑧 = 𝑥 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑥))
228227, 4elrab2 3682 . . . . . . . . . . . . . . . 16 (𝑥𝐽 ↔ (𝑥 ∈ ℕ ∧ ¬ 2 ∥ 𝑥))
229188, 225, 228sylanbrc 583 . . . . . . . . . . . . . . 15 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑥 ∈ ℕ) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → 𝑥𝐽)
230229adantlrr 717 . . . . . . . . . . . . . 14 (((𝐴 ∈ (𝑇𝑅) ∧ (𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) → 𝑥𝐽)
231230adantr 481 . . . . . . . . . . . . 13 ((((𝐴 ∈ (𝑇𝑅) ∧ (𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)) ∧ 𝑦 ∈ (bits‘(𝐴𝑥))) ∧ ((2↑𝑦) · 𝑥) = 𝐵) → 𝑥𝐽)
232 simprr 769 . . . . . . . . . . . . 13 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)) → ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)
233187, 231, 232r19.29af 3331 . . . . . . . . . . . 12 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)) → 𝑥𝐽)
234233, 232jca 512 . . . . . . . . . . 11 ((𝐴 ∈ (𝑇𝑅) ∧ (𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)) → (𝑥𝐽 ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵))
235234ex 413 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) → ((𝑥 ∈ ℕ ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵) → (𝑥𝐽 ∧ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)))
236235reximdv2 3271 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → (∃𝑥 ∈ ℕ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵 → ∃𝑥𝐽𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵))
237236imp 407 . . . . . . . 8 ((𝐴 ∈ (𝑇𝑅) ∧ ∃𝑥 ∈ ℕ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵) → ∃𝑥𝐽𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)
238237adantlr 711 . . . . . . 7 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑥 ∈ ℕ ∃𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵) → ∃𝑥𝐽𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)
239182, 238sylan2b 593 . . . . . 6 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) → ∃𝑥𝐽𝑦 ∈ (bits‘(𝐴𝑥))((2↑𝑦) · 𝑥) = 𝐵)
240172, 239r19.29vva 3336 . . . . 5 (((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) ∧ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵) → ∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵)
241128, 240impbida 797 . . . 4 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → (∃𝑤 ∈ (𝑀‘(bits ∘ (𝐴𝐽)))(𝐹𝑤) = 𝐵 ↔ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵))
24236, 241bitrd 280 . . 3 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → (𝐵 ∈ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))) ↔ ∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵))
243242ifbid 4487 . 2 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → if(𝐵 ∈ (𝐹 “ (𝑀‘(bits ∘ (𝐴𝐽)))), 1, 0) = if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵, 1, 0))
24413, 23, 2433eqtrd 2860 1 ((𝐴 ∈ (𝑇𝑅) ∧ 𝐵 ∈ ℕ) → ((𝐺𝐴)‘𝐵) = if(∃𝑡 ∈ ℕ ∃𝑛 ∈ (bits‘(𝐴𝑡))((2↑𝑛) · 𝑡) = 𝐵, 1, 0))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wo 841   = wceq 1528  wex 1771  wcel 2105  {cab 2799  wral 3138  wrex 3139  {crab 3142  Vcvv 3495  cin 3934  wss 3935  c0 4290  ifcif 4465  𝒫 cpw 4537  cop 4565   class class class wbr 5058  {copab 5120  cmpt 5138   × cxp 5547  ccnv 5548  dom cdm 5549  ran crn 5550  cres 5551  cima 5552  ccom 5553  Fun wfun 6343   Fn wfn 6344  wf 6345  1-1-ontowf1o 6348  cfv 6349  (class class class)co 7145  cmpo 7147  1st c1st 7678  2nd c2nd 7679   supp csupp 7821  m cmap 8396  Fincfn 8498  0cc0 10526  1c1 10527   · cmul 10531  cle 10665  cn 11627  2c2 11681  0cn0 11886  cexp 13419  Σcsu 15032  cdvds 15597  bitscbits 15758  𝟭cind 31169
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7450  ax-inf2 9093  ax-ac2 9874  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3or 1080  df-3an 1081  df-tru 1531  df-fal 1541  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4833  df-int 4870  df-iun 4914  df-disj 5024  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-se 5509  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-isom 6358  df-riota 7103  df-ov 7148  df-oprab 7149  df-mpo 7150  df-om 7569  df-1st 7680  df-2nd 7681  df-supp 7822  df-wrecs 7938  df-recs 7999  df-rdg 8037  df-1o 8093  df-2o 8094  df-oadd 8097  df-er 8279  df-map 8398  df-pm 8399  df-en 8499  df-dom 8500  df-sdom 8501  df-fin 8502  df-sup 8895  df-inf 8896  df-oi 8963  df-dju 9319  df-card 9357  df-acn 9360  df-ac 9531  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11628  df-2 11689  df-3 11690  df-n0 11887  df-xnn0 11957  df-z 11971  df-uz 12233  df-rp 12380  df-fz 12883  df-fzo 13024  df-fl 13152  df-mod 13228  df-seq 13360  df-exp 13420  df-hash 13681  df-cj 14448  df-re 14449  df-im 14450  df-sqrt 14584  df-abs 14585  df-clim 14835  df-sum 15033  df-dvds 15598  df-bits 15761  df-ind 31170
This theorem is referenced by:  eulerpartlemgs2  31538
  Copyright terms: Public domain W3C validator