sadaddlem - Metamath Proof Explorer

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

Theorem sadaddlem 16436

Description: Lemma for sadadd 16437. (Contributed by Mario Carneiro, 9-Sep-2016.)

**Hypotheses**
Ref	Expression
sadaddlem.c	⊢ 𝐶 = seq0((𝑐 ∈ 2_o, 𝑚 ∈ ℕ₀ ↦ if(cadd(𝑚 ∈ (bits‘𝐴), 𝑚 ∈ (bits‘𝐵), ∅ ∈ 𝑐), 1_o, ∅)), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
sadaddlem.k	⊢ 𝐾 = ^◡(bits ↾ ℕ₀)
sadaddlem.1	⊢ (𝜑 → 𝐴 ∈ ℤ)
sadaddlem.2	⊢ (𝜑 → 𝐵 ∈ ℤ)
sadaddlem.3	⊢ (𝜑 → 𝑁 ∈ ℕ₀)

**Assertion**
Ref	Expression
sadaddlem	⊢ (𝜑 → (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) = (bits‘((𝐴 + 𝐵) mod (2↑𝑁))))

Distinct variable groups: 𝑚,𝑐,𝑛 𝐴,𝑐,𝑚 𝐵,𝑐,𝑚 𝑛,𝑁 Allowed substitution hints: 𝜑(𝑚,𝑛,𝑐) 𝐴(𝑛) 𝐵(𝑛) 𝐶(𝑚,𝑛,𝑐) 𝐾(𝑚,𝑛,𝑐) 𝑁(𝑚,𝑐)

**Proof of Theorem sadaddlem**
Step	Hyp	Ref	Expression
1		2nn 12259	. . . . . . . . . 10 ⊢ 2 ∈ ℕ
2	1	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 2 ∈ ℕ)
3		sadaddlem.3	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
4	2, 3	nnexpcld 14210	. . . . . . . 8 ⊢ (𝜑 → (2↑𝑁) ∈ ℕ)
5	4	nnzd 12556	. . . . . . 7 ⊢ (𝜑 → (2↑𝑁) ∈ ℤ)
6		sadaddlem.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℤ)
7		inss1 4200	. . . . . . . . . . . 12 ⊢ ((bits‘𝐴) ∩ (0..^𝑁)) ⊆ (bits‘𝐴)
8		bitsss 16396	. . . . . . . . . . . 12 ⊢ (bits‘𝐴) ⊆ ℕ₀
9	7, 8	sstri 3956	. . . . . . . . . . 11 ⊢ ((bits‘𝐴) ∩ (0..^𝑁)) ⊆ ℕ₀
10		fzofi 13939	. . . . . . . . . . . 12 ⊢ (0..^𝑁) ∈ Fin
11		inss2 4201	. . . . . . . . . . . 12 ⊢ ((bits‘𝐴) ∩ (0..^𝑁)) ⊆ (0..^𝑁)
12		ssfi 9137	. . . . . . . . . . . 12 ⊢ (((0..^𝑁) ∈ Fin ∧ ((bits‘𝐴) ∩ (0..^𝑁)) ⊆ (0..^𝑁)) → ((bits‘𝐴) ∩ (0..^𝑁)) ∈ Fin)
13	10, 11, 12	mp2an 692	. . . . . . . . . . 11 ⊢ ((bits‘𝐴) ∩ (0..^𝑁)) ∈ Fin
14		elfpw 9305	. . . . . . . . . . 11 ⊢ (((bits‘𝐴) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) ↔ (((bits‘𝐴) ∩ (0..^𝑁)) ⊆ ℕ₀ ∧ ((bits‘𝐴) ∩ (0..^𝑁)) ∈ Fin))
15	9, 13, 14	mpbir2an 711	. . . . . . . . . 10 ⊢ ((bits‘𝐴) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin)
16		bitsf1o 16415	. . . . . . . . . . . . 13 ⊢ (bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin)
17		f1ocnv 6812	. . . . . . . . . . . . 13 ⊢ ((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) → ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀)
18		f1of 6800	. . . . . . . . . . . . 13 ⊢ (^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀ → ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀)
19	16, 17, 18	mp2b 10	. . . . . . . . . . . 12 ⊢ ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀
20		sadaddlem.k	. . . . . . . . . . . . 13 ⊢ 𝐾 = ^◡(bits ↾ ℕ₀)
21	20	feq1i 6679	. . . . . . . . . . . 12 ⊢ (𝐾:(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀ ↔ ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀)
22	19, 21	mpbir 231	. . . . . . . . . . 11 ⊢ 𝐾:(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀
23	22	ffvelcdmi 7055	. . . . . . . . . 10 ⊢ (((bits‘𝐴) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) → (𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) ∈ ℕ₀)
24	15, 23	mp1i 13	. . . . . . . . 9 ⊢ (𝜑 → (𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) ∈ ℕ₀)
25	24	nn0zd 12555	. . . . . . . 8 ⊢ (𝜑 → (𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) ∈ ℤ)
26	6, 25	zsubcld 12643	. . . . . . 7 ⊢ (𝜑 → (𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) ∈ ℤ)
27		sadaddlem.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℤ)
28		inss1 4200	. . . . . . . . . . . 12 ⊢ ((bits‘𝐵) ∩ (0..^𝑁)) ⊆ (bits‘𝐵)
29		bitsss 16396	. . . . . . . . . . . 12 ⊢ (bits‘𝐵) ⊆ ℕ₀
30	28, 29	sstri 3956	. . . . . . . . . . 11 ⊢ ((bits‘𝐵) ∩ (0..^𝑁)) ⊆ ℕ₀
31		inss2 4201	. . . . . . . . . . . 12 ⊢ ((bits‘𝐵) ∩ (0..^𝑁)) ⊆ (0..^𝑁)
32		ssfi 9137	. . . . . . . . . . . 12 ⊢ (((0..^𝑁) ∈ Fin ∧ ((bits‘𝐵) ∩ (0..^𝑁)) ⊆ (0..^𝑁)) → ((bits‘𝐵) ∩ (0..^𝑁)) ∈ Fin)
33	10, 31, 32	mp2an 692	. . . . . . . . . . 11 ⊢ ((bits‘𝐵) ∩ (0..^𝑁)) ∈ Fin
34		elfpw 9305	. . . . . . . . . . 11 ⊢ (((bits‘𝐵) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) ↔ (((bits‘𝐵) ∩ (0..^𝑁)) ⊆ ℕ₀ ∧ ((bits‘𝐵) ∩ (0..^𝑁)) ∈ Fin))
35	30, 33, 34	mpbir2an 711	. . . . . . . . . 10 ⊢ ((bits‘𝐵) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin)
36	22	ffvelcdmi 7055	. . . . . . . . . 10 ⊢ (((bits‘𝐵) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) → (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))) ∈ ℕ₀)
37	35, 36	mp1i 13	. . . . . . . . 9 ⊢ (𝜑 → (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))) ∈ ℕ₀)
38	37	nn0zd 12555	. . . . . . . 8 ⊢ (𝜑 → (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))) ∈ ℤ)
39	27, 38	zsubcld 12643	. . . . . . 7 ⊢ (𝜑 → (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) ∈ ℤ)
40	20	fveq1i 6859	. . . . . . . . . . . 12 ⊢ (𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) = (^◡(bits ↾ ℕ₀)‘((bits‘𝐴) ∩ (0..^𝑁)))
41	6, 4	zmodcld 13854	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐴 mod (2↑𝑁)) ∈ ℕ₀)
42	41	fvresd 6878	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐴 mod (2↑𝑁))) = (bits‘(𝐴 mod (2↑𝑁))))
43		bitsmod 16406	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → (bits‘(𝐴 mod (2↑𝑁))) = ((bits‘𝐴) ∩ (0..^𝑁)))
44	6, 3, 43	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (bits‘(𝐴 mod (2↑𝑁))) = ((bits‘𝐴) ∩ (0..^𝑁)))
45	42, 44	eqtrd 2764	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐴 mod (2↑𝑁))) = ((bits‘𝐴) ∩ (0..^𝑁)))
46		f1ocnvfv 7253	. . . . . . . . . . . . . 14 ⊢ (((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) ∧ (𝐴 mod (2↑𝑁)) ∈ ℕ₀) → (((bits ↾ ℕ₀)‘(𝐴 mod (2↑𝑁))) = ((bits‘𝐴) ∩ (0..^𝑁)) → (^◡(bits ↾ ℕ₀)‘((bits‘𝐴) ∩ (0..^𝑁))) = (𝐴 mod (2↑𝑁))))
47	16, 41, 46	sylancr 587	. . . . . . . . . . . . 13 ⊢ (𝜑 → (((bits ↾ ℕ₀)‘(𝐴 mod (2↑𝑁))) = ((bits‘𝐴) ∩ (0..^𝑁)) → (^◡(bits ↾ ℕ₀)‘((bits‘𝐴) ∩ (0..^𝑁))) = (𝐴 mod (2↑𝑁))))
48	45, 47	mpd 15	. . . . . . . . . . . 12 ⊢ (𝜑 → (^◡(bits ↾ ℕ₀)‘((bits‘𝐴) ∩ (0..^𝑁))) = (𝐴 mod (2↑𝑁)))
49	40, 48	eqtrid 2776	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) = (𝐴 mod (2↑𝑁)))
50	49	oveq2d 7403	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) = (𝐴 − (𝐴 mod (2↑𝑁))))
51	50	oveq1d 7402	. . . . . . . . 9 ⊢ (𝜑 → ((𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) / (2↑𝑁)) = ((𝐴 − (𝐴 mod (2↑𝑁))) / (2↑𝑁)))
52	6	zred 12638	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
53	4	nnrpd 12993	. . . . . . . . . 10 ⊢ (𝜑 → (2↑𝑁) ∈ ℝ⁺)
54		moddifz 13845	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ (2↑𝑁) ∈ ℝ⁺) → ((𝐴 − (𝐴 mod (2↑𝑁))) / (2↑𝑁)) ∈ ℤ)
55	52, 53, 54	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → ((𝐴 − (𝐴 mod (2↑𝑁))) / (2↑𝑁)) ∈ ℤ)
56	51, 55	eqeltrd 2828	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) / (2↑𝑁)) ∈ ℤ)
57	4	nnne0d 12236	. . . . . . . . 9 ⊢ (𝜑 → (2↑𝑁) ≠ 0)
58		dvdsval2 16225	. . . . . . . . 9 ⊢ (((2↑𝑁) ∈ ℤ ∧ (2↑𝑁) ≠ 0 ∧ (𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) ∈ ℤ) → ((2↑𝑁) ∥ (𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) ↔ ((𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) / (2↑𝑁)) ∈ ℤ))
59	5, 57, 26, 58	syl3anc 1373	. . . . . . . 8 ⊢ (𝜑 → ((2↑𝑁) ∥ (𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) ↔ ((𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) / (2↑𝑁)) ∈ ℤ))
60	56, 59	mpbird 257	. . . . . . 7 ⊢ (𝜑 → (2↑𝑁) ∥ (𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))))
61	20	fveq1i 6859	. . . . . . . . . . . 12 ⊢ (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))) = (^◡(bits ↾ ℕ₀)‘((bits‘𝐵) ∩ (0..^𝑁)))
62	27, 4	zmodcld 13854	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐵 mod (2↑𝑁)) ∈ ℕ₀)
63	62	fvresd 6878	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐵 mod (2↑𝑁))) = (bits‘(𝐵 mod (2↑𝑁))))
64		bitsmod 16406	. . . . . . . . . . . . . . 15 ⊢ ((𝐵 ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → (bits‘(𝐵 mod (2↑𝑁))) = ((bits‘𝐵) ∩ (0..^𝑁)))
65	27, 3, 64	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (bits‘(𝐵 mod (2↑𝑁))) = ((bits‘𝐵) ∩ (0..^𝑁)))
66	63, 65	eqtrd 2764	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐵 mod (2↑𝑁))) = ((bits‘𝐵) ∩ (0..^𝑁)))
67		f1ocnvfv 7253	. . . . . . . . . . . . . 14 ⊢ (((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) ∧ (𝐵 mod (2↑𝑁)) ∈ ℕ₀) → (((bits ↾ ℕ₀)‘(𝐵 mod (2↑𝑁))) = ((bits‘𝐵) ∩ (0..^𝑁)) → (^◡(bits ↾ ℕ₀)‘((bits‘𝐵) ∩ (0..^𝑁))) = (𝐵 mod (2↑𝑁))))
68	16, 62, 67	sylancr 587	. . . . . . . . . . . . 13 ⊢ (𝜑 → (((bits ↾ ℕ₀)‘(𝐵 mod (2↑𝑁))) = ((bits‘𝐵) ∩ (0..^𝑁)) → (^◡(bits ↾ ℕ₀)‘((bits‘𝐵) ∩ (0..^𝑁))) = (𝐵 mod (2↑𝑁))))
69	66, 68	mpd 15	. . . . . . . . . . . 12 ⊢ (𝜑 → (^◡(bits ↾ ℕ₀)‘((bits‘𝐵) ∩ (0..^𝑁))) = (𝐵 mod (2↑𝑁)))
70	61, 69	eqtrid 2776	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))) = (𝐵 mod (2↑𝑁)))
71	70	oveq2d 7403	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) = (𝐵 − (𝐵 mod (2↑𝑁))))
72	71	oveq1d 7402	. . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) / (2↑𝑁)) = ((𝐵 − (𝐵 mod (2↑𝑁))) / (2↑𝑁)))
73	27	zred 12638	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℝ)
74		moddifz 13845	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ ∧ (2↑𝑁) ∈ ℝ⁺) → ((𝐵 − (𝐵 mod (2↑𝑁))) / (2↑𝑁)) ∈ ℤ)
75	73, 53, 74	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − (𝐵 mod (2↑𝑁))) / (2↑𝑁)) ∈ ℤ)
76	72, 75	eqeltrd 2828	. . . . . . . 8 ⊢ (𝜑 → ((𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) / (2↑𝑁)) ∈ ℤ)
77		dvdsval2 16225	. . . . . . . . 9 ⊢ (((2↑𝑁) ∈ ℤ ∧ (2↑𝑁) ≠ 0 ∧ (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) ∈ ℤ) → ((2↑𝑁) ∥ (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) ↔ ((𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) / (2↑𝑁)) ∈ ℤ))
78	5, 57, 39, 77	syl3anc 1373	. . . . . . . 8 ⊢ (𝜑 → ((2↑𝑁) ∥ (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) ↔ ((𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) / (2↑𝑁)) ∈ ℤ))
79	76, 78	mpbird 257	. . . . . . 7 ⊢ (𝜑 → (2↑𝑁) ∥ (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))))
80	5, 26, 39, 60, 79	dvds2addd 16262	. . . . . 6 ⊢ (𝜑 → (2↑𝑁) ∥ ((𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) + (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))))))
81	6	zcnd 12639	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ)
82	27	zcnd 12639	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ)
83	24	nn0cnd 12505	. . . . . . 7 ⊢ (𝜑 → (𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) ∈ ℂ)
84	37	nn0cnd 12505	. . . . . . 7 ⊢ (𝜑 → (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))) ∈ ℂ)
85	81, 82, 83, 84	addsub4d 11580	. . . . . 6 ⊢ (𝜑 → ((𝐴 + 𝐵) − ((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))))) = ((𝐴 − (𝐾‘((bits‘𝐴) ∩ (0..^𝑁)))) + (𝐵 − (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))))))
86	80, 85	breqtrrd 5135	. . . . 5 ⊢ (𝜑 → (2↑𝑁) ∥ ((𝐴 + 𝐵) − ((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁))))))
87	6, 27	zaddcld 12642	. . . . . 6 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℤ)
88	25, 38	zaddcld 12642	. . . . . 6 ⊢ (𝜑 → ((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) ∈ ℤ)
89		moddvds 16233	. . . . . 6 ⊢ (((2↑𝑁) ∈ ℕ ∧ (𝐴 + 𝐵) ∈ ℤ ∧ ((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) ∈ ℤ) → (((𝐴 + 𝐵) mod (2↑𝑁)) = (((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) mod (2↑𝑁)) ↔ (2↑𝑁) ∥ ((𝐴 + 𝐵) − ((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))))))
90	4, 87, 88, 89	syl3anc 1373	. . . . 5 ⊢ (𝜑 → (((𝐴 + 𝐵) mod (2↑𝑁)) = (((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) mod (2↑𝑁)) ↔ (2↑𝑁) ∥ ((𝐴 + 𝐵) − ((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))))))
91	86, 90	mpbird 257	. . . 4 ⊢ (𝜑 → ((𝐴 + 𝐵) mod (2↑𝑁)) = (((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) mod (2↑𝑁)))
92	8	a1i 11	. . . . 5 ⊢ (𝜑 → (bits‘𝐴) ⊆ ℕ₀)
93	29	a1i 11	. . . . 5 ⊢ (𝜑 → (bits‘𝐵) ⊆ ℕ₀)
94		sadaddlem.c	. . . . 5 ⊢ 𝐶 = seq0((𝑐 ∈ 2_o, 𝑚 ∈ ℕ₀ ↦ if(cadd(𝑚 ∈ (bits‘𝐴), 𝑚 ∈ (bits‘𝐵), ∅ ∈ 𝑐), 1_o, ∅)), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
95	92, 93, 94, 3, 20	sadadd3 16431	. . . 4 ⊢ (𝜑 → ((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) mod (2↑𝑁)) = (((𝐾‘((bits‘𝐴) ∩ (0..^𝑁))) + (𝐾‘((bits‘𝐵) ∩ (0..^𝑁)))) mod (2↑𝑁)))
96		inss1 4200	. . . . . . . . 9 ⊢ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ⊆ ((bits‘𝐴) sadd (bits‘𝐵))
97		sadcl 16432	. . . . . . . . . 10 ⊢ (((bits‘𝐴) ⊆ ℕ₀ ∧ (bits‘𝐵) ⊆ ℕ₀) → ((bits‘𝐴) sadd (bits‘𝐵)) ⊆ ℕ₀)
98	8, 29, 97	mp2an 692	. . . . . . . . 9 ⊢ ((bits‘𝐴) sadd (bits‘𝐵)) ⊆ ℕ₀
99	96, 98	sstri 3956	. . . . . . . 8 ⊢ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ⊆ ℕ₀
100		inss2 4201	. . . . . . . . 9 ⊢ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ⊆ (0..^𝑁)
101		ssfi 9137	. . . . . . . . 9 ⊢ (((0..^𝑁) ∈ Fin ∧ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ⊆ (0..^𝑁)) → (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ Fin)
102	10, 100, 101	mp2an 692	. . . . . . . 8 ⊢ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ Fin
103		elfpw 9305	. . . . . . . 8 ⊢ ((((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) ↔ ((((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ⊆ ℕ₀ ∧ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ Fin))
104	99, 102, 103	mpbir2an 711	. . . . . . 7 ⊢ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin)
105	22	ffvelcdmi 7055	. . . . . . 7 ⊢ ((((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ ℕ₀)
106	104, 105	mp1i 13	. . . . . 6 ⊢ (𝜑 → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ ℕ₀)
107	106	nn0red 12504	. . . . 5 ⊢ (𝜑 → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ ℝ)
108	106	nn0ge0d 12506	. . . . 5 ⊢ (𝜑 → 0 ≤ (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))))
109	20	fveq1i 6859	. . . . . . . . . 10 ⊢ (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) = (^◡(bits ↾ ℕ₀)‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))
110	109	fveq2i 6861	. . . . . . . . 9 ⊢ ((bits ↾ ℕ₀)‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) = ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))))
111	106	fvresd 6878	. . . . . . . . 9 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) = (bits‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))))
112	104	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin))
113		f1ocnvfv2 7252	. . . . . . . . . 10 ⊢ (((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) ∧ (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin)) → ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) = (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))
114	16, 112, 113	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) = (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))
115	110, 111, 114	3eqtr3a 2788	. . . . . . . 8 ⊢ (𝜑 → (bits‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) = (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))
116	115, 100	eqsstrdi 3991	. . . . . . 7 ⊢ (𝜑 → (bits‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) ⊆ (0..^𝑁))
117	106	nn0zd 12555	. . . . . . . 8 ⊢ (𝜑 → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ ℤ)
118		bitsfzo 16405	. . . . . . . 8 ⊢ (((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → ((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) ↔ (bits‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) ⊆ (0..^𝑁)))
119	117, 3, 118	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → ((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) ↔ (bits‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))) ⊆ (0..^𝑁)))
120	116, 119	mpbird 257	. . . . . 6 ⊢ (𝜑 → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)))
121		elfzolt2 13629	. . . . . 6 ⊢ ((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) < (2↑𝑁))
122	120, 121	syl 17	. . . . 5 ⊢ (𝜑 → (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) < (2↑𝑁))
123		modid 13858	. . . . 5 ⊢ ((((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∈ ℝ ∧ (2↑𝑁) ∈ ℝ⁺) ∧ (0 ≤ (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) ∧ (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) < (2↑𝑁))) → ((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) mod (2↑𝑁)) = (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))))
124	107, 53, 108, 122, 123	syl22anc 838	. . . 4 ⊢ (𝜑 → ((𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))) mod (2↑𝑁)) = (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))))
125	91, 95, 124	3eqtr2d 2770	. . 3 ⊢ (𝜑 → ((𝐴 + 𝐵) mod (2↑𝑁)) = (𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁))))
126	125	fveq2d 6862	. 2 ⊢ (𝜑 → (bits‘((𝐴 + 𝐵) mod (2↑𝑁))) = (bits‘(𝐾‘(((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)))))
127	126, 115	eqtr2d 2765	1 ⊢ (𝜑 → (((bits‘𝐴) sadd (bits‘𝐵)) ∩ (0..^𝑁)) = (bits‘((𝐴 + 𝐵) mod (2↑𝑁))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 caddwcad 1606 ∈ wcel 2109 ≠ wne 2925 ∩ cin 3913 ⊆ wss 3914 ∅c0 4296 ifcif 4488 𝒫 cpw 4563 class class class wbr 5107 ↦ cmpt 5188 ^◡ccnv 5637 ↾ cres 5640 ⟶wf 6507 –1-1-onto→wf1o 6510 ‘cfv 6511 (class class class)co 7387 ∈ cmpo 7389 1_oc1o 8427 2_oc2o 8428 Fincfn 8918 ℝcr 11067 0cc0 11068 1c1 11069 + caddc 11071 < clt 11208 ≤ cle 11209 − cmin 11405 / cdiv 11835 ℕcn 12186 2c2 12241 ℕ₀cn0 12442 ℤcz 12529 ℝ⁺crp 12951 ..^cfzo 13615 mod cmo 13831 seqcseq 13966 ↑cexp 14026 ∥ cdvds 16222 bitscbits 16389 sadd csad 16390

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-xor 1512 df-tru 1543 df-fal 1553 df-had 1594 df-cad 1607 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-disj 5075 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-oadd 8438 df-er 8671 df-map 8801 df-pm 8802 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-sup 9393 df-inf 9394 df-oi 9463 df-dju 9854 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-xnn0 12516 df-z 12530 df-uz 12794 df-rp 12952 df-fz 13469 df-fzo 13616 df-fl 13754 df-mod 13832 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-clim 15454 df-sum 15653 df-dvds 16223 df-bits 16392 df-sad 16421

This theorem is referenced by: sadadd 16437

W3C validator