sadcaddlem - Metamath Proof Explorer

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

Theorem sadcaddlem 16421

Description: Lemma for sadcadd 16422. (Contributed by Mario Carneiro, 8-Sep-2016.)

**Hypotheses**
Ref	Expression
sadval.a	⊢ (𝜑 → 𝐴 ⊆ ℕ₀)
sadval.b	⊢ (𝜑 → 𝐵 ⊆ ℕ₀)
sadval.c	⊢ 𝐶 = seq0((𝑐 ∈ 2_o, 𝑚 ∈ ℕ₀ ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1_o, ∅)), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
sadcp1.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
sadcadd.k	⊢ 𝐾 = ^◡(bits ↾ ℕ₀)
sadcaddlem.1	⊢ (𝜑 → (∅ ∈ (𝐶‘𝑁) ↔ (2↑𝑁) ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁))))))

**Assertion**
Ref	Expression
sadcaddlem	⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ (2↑(𝑁 + 1)) ≤ ((𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) + (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1)))))))

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

**Proof of Theorem sadcaddlem**
Step	Hyp	Ref	Expression
1		cad1 1625	. . . . 5 ⊢ (∅ ∈ (𝐶‘𝑁) → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)))
2	1	adantl 483	. . . 4 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)))
3		2nn 12249	. . . . . . . . . . 11 ⊢ 2 ∈ ℕ
4	3	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ ℕ)
5		sadcp1.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
6	4, 5	nnexpcld 14202	. . . . . . . . 9 ⊢ (𝜑 → (2↑𝑁) ∈ ℕ)
7	6	nnred 12184	. . . . . . . 8 ⊢ (𝜑 → (2↑𝑁) ∈ ℝ)
8	7	ad2antrr 733	. . . . . . 7 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)) → (2↑𝑁) ∈ ℝ)
9		inss1 4167	. . . . . . . . . . . . 13 ⊢ (𝐴 ∩ (0..^𝑁)) ⊆ 𝐴
10		sadval.a	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ⊆ ℕ₀)
11	9, 10	sstrid 3927	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 ∩ (0..^𝑁)) ⊆ ℕ₀)
12		fzofi 13931	. . . . . . . . . . . . . 14 ⊢ (0..^𝑁) ∈ Fin
13	12	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0..^𝑁) ∈ Fin)
14		inss2 4168	. . . . . . . . . . . . 13 ⊢ (𝐴 ∩ (0..^𝑁)) ⊆ (0..^𝑁)
15		ssfi 9101	. . . . . . . . . . . . 13 ⊢ (((0..^𝑁) ∈ Fin ∧ (𝐴 ∩ (0..^𝑁)) ⊆ (0..^𝑁)) → (𝐴 ∩ (0..^𝑁)) ∈ Fin)
16	13, 14, 15	sylancl 593	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 ∩ (0..^𝑁)) ∈ Fin)
17		elfpw 9258	. . . . . . . . . . . 12 ⊢ ((𝐴 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) ↔ ((𝐴 ∩ (0..^𝑁)) ⊆ ℕ₀ ∧ (𝐴 ∩ (0..^𝑁)) ∈ Fin))
18	11, 16, 17	sylanbrc 590	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin))
19		bitsf1o 16409	. . . . . . . . . . . . . . 15 ⊢ (bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin)
20		f1ocnv 6782	. . . . . . . . . . . . . . 15 ⊢ ((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) → ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀)
21	19, 20	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀
22		sadcadd.k	. . . . . . . . . . . . . . 15 ⊢ 𝐾 = ^◡(bits ↾ ℕ₀)
23		f1oeq1 6758	. . . . . . . . . . . . . . 15 ⊢ (𝐾 = ^◡(bits ↾ ℕ₀) → (𝐾:(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀ ↔ ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀))
24	22, 23	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ (𝐾:(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀ ↔ ^◡(bits ↾ ℕ₀):(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀)
25	21, 24	mpbir 233	. . . . . . . . . . . . 13 ⊢ 𝐾:(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀
26		f1of 6770	. . . . . . . . . . . . 13 ⊢ (𝐾:(𝒫 ℕ₀ ∩ Fin)–1-1-onto→ℕ₀ → 𝐾:(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀)
27	25, 26	ax-mp 5	. . . . . . . . . . . 12 ⊢ 𝐾:(𝒫 ℕ₀ ∩ Fin)⟶ℕ₀
28	27	ffvelcdmi 7027	. . . . . . . . . . 11 ⊢ ((𝐴 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℕ₀)
29	18, 28	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℕ₀)
30		inss1 4167	. . . . . . . . . . . . 13 ⊢ (𝐵 ∩ (0..^𝑁)) ⊆ 𝐵
31		sadval.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ⊆ ℕ₀)
32	30, 31	sstrid 3927	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐵 ∩ (0..^𝑁)) ⊆ ℕ₀)
33		inss2 4168	. . . . . . . . . . . . 13 ⊢ (𝐵 ∩ (0..^𝑁)) ⊆ (0..^𝑁)
34		ssfi 9101	. . . . . . . . . . . . 13 ⊢ (((0..^𝑁) ∈ Fin ∧ (𝐵 ∩ (0..^𝑁)) ⊆ (0..^𝑁)) → (𝐵 ∩ (0..^𝑁)) ∈ Fin)
35	13, 33, 34	sylancl 593	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐵 ∩ (0..^𝑁)) ∈ Fin)
36		elfpw 9258	. . . . . . . . . . . 12 ⊢ ((𝐵 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) ↔ ((𝐵 ∩ (0..^𝑁)) ⊆ ℕ₀ ∧ (𝐵 ∩ (0..^𝑁)) ∈ Fin))
37	32, 35, 36	sylanbrc 590	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin))
38	27	ffvelcdmi 7027	. . . . . . . . . . 11 ⊢ ((𝐵 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin) → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℕ₀)
39	37, 38	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℕ₀)
40	29, 39	nn0addcld 12497	. . . . . . . . 9 ⊢ (𝜑 → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℕ₀)
41	40	nn0red 12494	. . . . . . . 8 ⊢ (𝜑 → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℝ)
42	41	ad2antrr 733	. . . . . . 7 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℝ)
43		2nn0 12449	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℕ₀
44	43	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐴) → 2 ∈ ℕ₀)
45	5	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐴) → 𝑁 ∈ ℕ₀)
46	44, 45	nn0expcld 14203	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐴) → (2↑𝑁) ∈ ℕ₀)
47		0nn0 12447	. . . . . . . . . . . 12 ⊢ 0 ∈ ℕ₀
48	47	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑁 ∈ 𝐴) → 0 ∈ ℕ₀)
49	46, 48	ifclda 4492	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ∈ ℕ₀)
50	43	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐵) → 2 ∈ ℕ₀)
51	5	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐵) → 𝑁 ∈ ℕ₀)
52	50, 51	nn0expcld 14203	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐵) → (2↑𝑁) ∈ ℕ₀)
53	47	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑁 ∈ 𝐵) → 0 ∈ ℕ₀)
54	52, 53	ifclda 4492	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ∈ ℕ₀)
55	49, 54	nn0addcld 12497	. . . . . . . . 9 ⊢ (𝜑 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ∈ ℕ₀)
56	55	nn0red 12494	. . . . . . . 8 ⊢ (𝜑 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ∈ ℝ)
57	56	ad2antrr 733	. . . . . . 7 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ∈ ℝ)
58		sadcaddlem.1	. . . . . . . . 9 ⊢ (𝜑 → (∅ ∈ (𝐶‘𝑁) ↔ (2↑𝑁) ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁))))))
59	58	biimpa 478	. . . . . . . 8 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → (2↑𝑁) ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))))
60	59	adantr 482	. . . . . . 7 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)) → (2↑𝑁) ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))))
61	6	nnnn0d 12493	. . . . . . . . . . . . 13 ⊢ (𝜑 → (2↑𝑁) ∈ ℕ₀)
62		ifcl 4502	. . . . . . . . . . . . 13 ⊢ (((2↑𝑁) ∈ ℕ₀ ∧ 0 ∈ ℕ₀) → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ∈ ℕ₀)
63	61, 47, 62	sylancl 593	. . . . . . . . . . . 12 ⊢ (𝜑 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ∈ ℕ₀)
64	63	nn0ge0d 12496	. . . . . . . . . . 11 ⊢ (𝜑 → 0 ≤ if(𝑁 ∈ 𝐵, (2↑𝑁), 0))
65	7	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐵) → (2↑𝑁) ∈ ℝ)
66		0red 11143	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝑁 ∈ 𝐵) → 0 ∈ ℝ)
67	65, 66	ifclda 4492	. . . . . . . . . . . 12 ⊢ (𝜑 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ∈ ℝ)
68	7, 67	addge01d 11734	. . . . . . . . . . 11 ⊢ (𝜑 → (0 ≤ if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ↔ (2↑𝑁) ≤ ((2↑𝑁) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
69	64, 68	mpbid 234	. . . . . . . . . 10 ⊢ (𝜑 → (2↑𝑁) ≤ ((2↑𝑁) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
70	69	ad2antrr 733	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐴) → (2↑𝑁) ≤ ((2↑𝑁) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
71		iftrue 4462	. . . . . . . . . . 11 ⊢ (𝑁 ∈ 𝐴 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) = (2↑𝑁))
72	71	adantl 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐴) → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) = (2↑𝑁))
73	72	oveq1d 7374	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐴) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = ((2↑𝑁) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
74	70, 73	breqtrrd 5102	. . . . . . . 8 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐴) → (2↑𝑁) ≤ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
75		ifcl 4502	. . . . . . . . . . . . 13 ⊢ (((2↑𝑁) ∈ ℕ₀ ∧ 0 ∈ ℕ₀) → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ∈ ℕ₀)
76	61, 47, 75	sylancl 593	. . . . . . . . . . . 12 ⊢ (𝜑 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ∈ ℕ₀)
77	76	nn0ge0d 12496	. . . . . . . . . . 11 ⊢ (𝜑 → 0 ≤ if(𝑁 ∈ 𝐴, (2↑𝑁), 0))
78	7	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑁 ∈ 𝐴) → (2↑𝑁) ∈ ℝ)
79		0red 11143	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝑁 ∈ 𝐴) → 0 ∈ ℝ)
80	78, 79	ifclda 4492	. . . . . . . . . . . 12 ⊢ (𝜑 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ∈ ℝ)
81	7, 80	addge02d 11735	. . . . . . . . . . 11 ⊢ (𝜑 → (0 ≤ if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ↔ (2↑𝑁) ≤ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + (2↑𝑁))))
82	77, 81	mpbid 234	. . . . . . . . . 10 ⊢ (𝜑 → (2↑𝑁) ≤ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + (2↑𝑁)))
83	82	ad2antrr 733	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐵) → (2↑𝑁) ≤ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + (2↑𝑁)))
84		iftrue 4462	. . . . . . . . . . 11 ⊢ (𝑁 ∈ 𝐵 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) = (2↑𝑁))
85	84	adantl 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐵) → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) = (2↑𝑁))
86	85	oveq2d 7375	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐵) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + (2↑𝑁)))
87	83, 86	breqtrrd 5102	. . . . . . . 8 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ 𝑁 ∈ 𝐵) → (2↑𝑁) ≤ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
88	74, 87	jaodan 966	. . . . . . 7 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)) → (2↑𝑁) ≤ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
89	8, 8, 42, 57, 60, 88	le2addd 11765	. . . . . 6 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵)) → ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
90	89	ex 414	. . . . 5 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → ((𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵) → ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
91		ioran 992	. . . . . 6 ⊢ (¬ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵) ↔ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵))
92		iffalse 4465	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑁 ∈ 𝐴 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) = 0)
93	92	ad2antrl 735	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) = 0)
94		iffalse 4465	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑁 ∈ 𝐵 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) = 0)
95	94	ad2antll 736	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) = 0)
96	93, 95	oveq12d 7377	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = (0 + 0))
97		00id 11317	. . . . . . . . . . . 12 ⊢ (0 + 0) = 0
98	96, 97	eqtrdi 2792	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = 0)
99	98	oveq2d 7375	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) = (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + 0))
100	29	nn0red 12494	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℝ)
101	100	ad2antrr 733	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℝ)
102	39	nn0red 12494	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℝ)
103	102	ad2antrr 733	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℝ)
104	101, 103	readdcld 11170	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℝ)
105	104	recnd 11169	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℂ)
106	105	addridd 11342	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + 0) = ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))))
107	99, 106	eqtrd 2776	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) = ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))))
108	22	fveq1i 6831	. . . . . . . . . . . . . . . 16 ⊢ (𝐾‘(𝐴 ∩ (0..^𝑁))) = (^◡(bits ↾ ℕ₀)‘(𝐴 ∩ (0..^𝑁)))
109	108	fveq2i 6833	. . . . . . . . . . . . . . 15 ⊢ ((bits ↾ ℕ₀)‘(𝐾‘(𝐴 ∩ (0..^𝑁)))) = ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(𝐴 ∩ (0..^𝑁))))
110	29	fvresd 6850	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐾‘(𝐴 ∩ (0..^𝑁)))) = (bits‘(𝐾‘(𝐴 ∩ (0..^𝑁)))))
111		f1ocnvfv2 7224	. . . . . . . . . . . . . . . 16 ⊢ (((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) ∧ (𝐴 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin)) → ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(𝐴 ∩ (0..^𝑁)))) = (𝐴 ∩ (0..^𝑁)))
112	19, 18, 111	sylancr 594	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(𝐴 ∩ (0..^𝑁)))) = (𝐴 ∩ (0..^𝑁)))
113	109, 110, 112	3eqtr3a 2800	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (bits‘(𝐾‘(𝐴 ∩ (0..^𝑁)))) = (𝐴 ∩ (0..^𝑁)))
114	113, 14	eqsstrdi 3960	. . . . . . . . . . . . 13 ⊢ (𝜑 → (bits‘(𝐾‘(𝐴 ∩ (0..^𝑁)))) ⊆ (0..^𝑁))
115	29	nn0zd 12544	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℤ)
116		bitsfzo 16399	. . . . . . . . . . . . . 14 ⊢ (((𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) ↔ (bits‘(𝐾‘(𝐴 ∩ (0..^𝑁)))) ⊆ (0..^𝑁)))
117	115, 5, 116	syl2anc 591	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) ↔ (bits‘(𝐾‘(𝐴 ∩ (0..^𝑁)))) ⊆ (0..^𝑁)))
118	114, 117	mpbird 259	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)))
119		elfzolt2 13618	. . . . . . . . . . . 12 ⊢ ((𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) → (𝐾‘(𝐴 ∩ (0..^𝑁))) < (2↑𝑁))
120	118, 119	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^𝑁))) < (2↑𝑁))
121	22	fveq1i 6831	. . . . . . . . . . . . . . . 16 ⊢ (𝐾‘(𝐵 ∩ (0..^𝑁))) = (^◡(bits ↾ ℕ₀)‘(𝐵 ∩ (0..^𝑁)))
122	121	fveq2i 6833	. . . . . . . . . . . . . . 15 ⊢ ((bits ↾ ℕ₀)‘(𝐾‘(𝐵 ∩ (0..^𝑁)))) = ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(𝐵 ∩ (0..^𝑁))))
123	39	fvresd 6850	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(𝐾‘(𝐵 ∩ (0..^𝑁)))) = (bits‘(𝐾‘(𝐵 ∩ (0..^𝑁)))))
124		f1ocnvfv2 7224	. . . . . . . . . . . . . . . 16 ⊢ (((bits ↾ ℕ₀):ℕ₀–1-1-onto→(𝒫 ℕ₀ ∩ Fin) ∧ (𝐵 ∩ (0..^𝑁)) ∈ (𝒫 ℕ₀ ∩ Fin)) → ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(𝐵 ∩ (0..^𝑁)))) = (𝐵 ∩ (0..^𝑁)))
125	19, 37, 124	sylancr 594	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((bits ↾ ℕ₀)‘(^◡(bits ↾ ℕ₀)‘(𝐵 ∩ (0..^𝑁)))) = (𝐵 ∩ (0..^𝑁)))
126	122, 123, 125	3eqtr3a 2800	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (bits‘(𝐾‘(𝐵 ∩ (0..^𝑁)))) = (𝐵 ∩ (0..^𝑁)))
127	126, 33	eqsstrdi 3960	. . . . . . . . . . . . 13 ⊢ (𝜑 → (bits‘(𝐾‘(𝐵 ∩ (0..^𝑁)))) ⊆ (0..^𝑁))
128	39	nn0zd 12544	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℤ)
129		bitsfzo 16399	. . . . . . . . . . . . . 14 ⊢ (((𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → ((𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) ↔ (bits‘(𝐾‘(𝐵 ∩ (0..^𝑁)))) ⊆ (0..^𝑁)))
130	128, 5, 129	syl2anc 591	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) ↔ (bits‘(𝐾‘(𝐵 ∩ (0..^𝑁)))) ⊆ (0..^𝑁)))
131	127, 130	mpbird 259	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)))
132		elfzolt2 13618	. . . . . . . . . . . 12 ⊢ ((𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ (0..^(2↑𝑁)) → (𝐾‘(𝐵 ∩ (0..^𝑁))) < (2↑𝑁))
133	131, 132	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^𝑁))) < (2↑𝑁))
134	100, 102, 7, 7, 120, 133	lt2addd 11769	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) < ((2↑𝑁) + (2↑𝑁)))
135	134	ad2antrr 733	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) < ((2↑𝑁) + (2↑𝑁)))
136	107, 135	eqbrtrd 5096	. . . . . . . 8 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) < ((2↑𝑁) + (2↑𝑁)))
137	80	ad2antrr 733	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ∈ ℝ)
138	67	ad2antrr 733	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ∈ ℝ)
139	137, 138	readdcld 11170	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ∈ ℝ)
140	104, 139	readdcld 11170	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) ∈ ℝ)
141	7	ad2antrr 733	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → (2↑𝑁) ∈ ℝ)
142	141, 141	readdcld 11170	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → ((2↑𝑁) + (2↑𝑁)) ∈ ℝ)
143	140, 142	ltnled 11289	. . . . . . . 8 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → ((((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) < ((2↑𝑁) + (2↑𝑁)) ↔ ¬ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
144	136, 143	mpbid 234	. . . . . . 7 ⊢ (((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) ∧ (¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵)) → ¬ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
145	144	ex 414	. . . . . 6 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → ((¬ 𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ∈ 𝐵) → ¬ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
146	91, 145	biimtrid 244	. . . . 5 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → (¬ (𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵) → ¬ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
147	90, 146	impcon4bid 229	. . . 4 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → ((𝑁 ∈ 𝐴 ∨ 𝑁 ∈ 𝐵) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
148	2, 147	bitrd 281	. . 3 ⊢ ((𝜑 ∧ ∅ ∈ (𝐶‘𝑁)) → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
149		cad0 1626	. . . . 5 ⊢ (¬ ∅ ∈ (𝐶‘𝑁) → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)))
150	149	adantl 483	. . . 4 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)))
151	40	nn0ge0d 12496	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))))
152	7, 7	readdcld 11170	. . . . . . . . . 10 ⊢ (𝜑 → ((2↑𝑁) + (2↑𝑁)) ∈ ℝ)
153	152, 41	addge02d 11735	. . . . . . . . 9 ⊢ (𝜑 → (0 ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + ((2↑𝑁) + (2↑𝑁)))))
154	151, 153	mpbid 234	. . . . . . . 8 ⊢ (𝜑 → ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + ((2↑𝑁) + (2↑𝑁))))
155	154	ad2antrr 733	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)) → ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + ((2↑𝑁) + (2↑𝑁))))
156	71, 84	oveqan12d 7378	. . . . . . . . 9 ⊢ ((𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = ((2↑𝑁) + (2↑𝑁)))
157	156	adantl 483	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = ((2↑𝑁) + (2↑𝑁)))
158	157	oveq2d 7375	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) = (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + ((2↑𝑁) + (2↑𝑁))))
159	155, 158	breqtrrd 5102	. . . . . 6 ⊢ (((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) ∧ (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)) → ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
160	159	ex 414	. . . . 5 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵) → ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
161	100	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℝ)
162	102	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℝ)
163	161, 162	readdcld 11170	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℝ)
164	7	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (2↑𝑁) ∈ ℝ)
165	7, 41	lenltd 11288	. . . . . . . . . . . 12 ⊢ (𝜑 → ((2↑𝑁) ≤ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ↔ ¬ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) < (2↑𝑁)))
166	58, 165	bitrd 281	. . . . . . . . . . 11 ⊢ (𝜑 → (∅ ∈ (𝐶‘𝑁) ↔ ¬ ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) < (2↑𝑁)))
167	166	con2bid 356	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) < (2↑𝑁) ↔ ¬ ∅ ∈ (𝐶‘𝑁)))
168	167	biimpar 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) < (2↑𝑁))
169	163, 164, 164, 168	ltadd1dd 11757	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < ((2↑𝑁) + (2↑𝑁)))
170	163, 164	readdcld 11170	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) ∈ ℝ)
171	152	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((2↑𝑁) + (2↑𝑁)) ∈ ℝ)
172	41, 56	readdcld 11170	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) ∈ ℝ)
173	172	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) ∈ ℝ)
174		ltletr 11234	. . . . . . . . 9 ⊢ (((((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) ∈ ℝ ∧ ((2↑𝑁) + (2↑𝑁)) ∈ ℝ ∧ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) ∈ ℝ) → (((((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < ((2↑𝑁) + (2↑𝑁)) ∧ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
175	170, 171, 173, 174	syl3anc 1380	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < ((2↑𝑁) + (2↑𝑁)) ∧ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
176	169, 175	mpand 702	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
177	56	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ∈ ℝ)
178	41	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) ∈ ℝ)
179	164, 177, 178	ltadd2d 11298	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((2↑𝑁) < (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ↔ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (2↑𝑁)) < (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
180	176, 179	sylibrd 261	. . . . . 6 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) → (2↑𝑁) < (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
181	7, 56	ltnled 11289	. . . . . . . 8 ⊢ (𝜑 → ((2↑𝑁) < (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ↔ ¬ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁)))
182	63	nn0cnd 12495	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ∈ ℂ)
183	182	addlidd 11343	. . . . . . . . . . . 12 ⊢ (𝜑 → (0 + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = if(𝑁 ∈ 𝐵, (2↑𝑁), 0))
184	7	leidd 11712	. . . . . . . . . . . . 13 ⊢ (𝜑 → (2↑𝑁) ≤ (2↑𝑁))
185	61	nn0ge0d 12496	. . . . . . . . . . . . 13 ⊢ (𝜑 → 0 ≤ (2↑𝑁))
186		breq1 5077	. . . . . . . . . . . . . 14 ⊢ ((2↑𝑁) = if(𝑁 ∈ 𝐵, (2↑𝑁), 0) → ((2↑𝑁) ≤ (2↑𝑁) ↔ if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ≤ (2↑𝑁)))
187		breq1 5077	. . . . . . . . . . . . . 14 ⊢ (0 = if(𝑁 ∈ 𝐵, (2↑𝑁), 0) → (0 ≤ (2↑𝑁) ↔ if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ≤ (2↑𝑁)))
188	186, 187	ifboth 4496	. . . . . . . . . . . . 13 ⊢ (((2↑𝑁) ≤ (2↑𝑁) ∧ 0 ≤ (2↑𝑁)) → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ≤ (2↑𝑁))
189	184, 185, 188	syl2anc 591	. . . . . . . . . . . 12 ⊢ (𝜑 → if(𝑁 ∈ 𝐵, (2↑𝑁), 0) ≤ (2↑𝑁))
190	183, 189	eqbrtrd 5096	. . . . . . . . . . 11 ⊢ (𝜑 → (0 + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁))
191	92	oveq1d 7374	. . . . . . . . . . . 12 ⊢ (¬ 𝑁 ∈ 𝐴 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = (0 + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
192	191	breq1d 5084	. . . . . . . . . . 11 ⊢ (¬ 𝑁 ∈ 𝐴 → ((if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁) ↔ (0 + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁)))
193	190, 192	syl5ibrcom 249	. . . . . . . . . 10 ⊢ (𝜑 → (¬ 𝑁 ∈ 𝐴 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁)))
194	193	con1d 145	. . . . . . . . 9 ⊢ (𝜑 → (¬ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁) → 𝑁 ∈ 𝐴))
195	76	nn0cnd 12495	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ∈ ℂ)
196	195	addridd 11342	. . . . . . . . . . . 12 ⊢ (𝜑 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + 0) = if(𝑁 ∈ 𝐴, (2↑𝑁), 0))
197		breq1 5077	. . . . . . . . . . . . . 14 ⊢ ((2↑𝑁) = if(𝑁 ∈ 𝐴, (2↑𝑁), 0) → ((2↑𝑁) ≤ (2↑𝑁) ↔ if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ≤ (2↑𝑁)))
198		breq1 5077	. . . . . . . . . . . . . 14 ⊢ (0 = if(𝑁 ∈ 𝐴, (2↑𝑁), 0) → (0 ≤ (2↑𝑁) ↔ if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ≤ (2↑𝑁)))
199	197, 198	ifboth 4496	. . . . . . . . . . . . 13 ⊢ (((2↑𝑁) ≤ (2↑𝑁) ∧ 0 ≤ (2↑𝑁)) → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ≤ (2↑𝑁))
200	184, 185, 199	syl2anc 591	. . . . . . . . . . . 12 ⊢ (𝜑 → if(𝑁 ∈ 𝐴, (2↑𝑁), 0) ≤ (2↑𝑁))
201	196, 200	eqbrtrd 5096	. . . . . . . . . . 11 ⊢ (𝜑 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + 0) ≤ (2↑𝑁))
202	94	oveq2d 7375	. . . . . . . . . . . 12 ⊢ (¬ 𝑁 ∈ 𝐵 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) = (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + 0))
203	202	breq1d 5084	. . . . . . . . . . 11 ⊢ (¬ 𝑁 ∈ 𝐵 → ((if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁) ↔ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + 0) ≤ (2↑𝑁)))
204	201, 203	syl5ibrcom 249	. . . . . . . . . 10 ⊢ (𝜑 → (¬ 𝑁 ∈ 𝐵 → (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁)))
205	204	con1d 145	. . . . . . . . 9 ⊢ (𝜑 → (¬ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁) → 𝑁 ∈ 𝐵))
206	194, 205	jcad 518	. . . . . . . 8 ⊢ (𝜑 → (¬ (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) ≤ (2↑𝑁) → (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)))
207	181, 206	sylbid 242	. . . . . . 7 ⊢ (𝜑 → ((2↑𝑁) < (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) → (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)))
208	207	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((2↑𝑁) < (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)) → (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)))
209	180, 208	syld 47	. . . . 5 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) → (𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵)))
210	160, 209	impbid 214	. . . 4 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → ((𝑁 ∈ 𝐴 ∧ 𝑁 ∈ 𝐵) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
211	150, 210	bitrd 281	. . 3 ⊢ ((𝜑 ∧ ¬ ∅ ∈ (𝐶‘𝑁)) → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
212	148, 211	pm2.61dan 819	. 2 ⊢ (𝜑 → (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
213		sadval.c	. . 3 ⊢ 𝐶 = seq0((𝑐 ∈ 2_o, 𝑚 ∈ ℕ₀ ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1_o, ∅)), (𝑛 ∈ ℕ₀ ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
214	10, 31, 213, 5	sadcp1 16419	. 2 ⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁))))
215		2cnd 12254	. . . . 5 ⊢ (𝜑 → 2 ∈ ℂ)
216	215, 5	expp1d 14104	. . . 4 ⊢ (𝜑 → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
217	6	nncnd 12185	. . . . 5 ⊢ (𝜑 → (2↑𝑁) ∈ ℂ)
218	217	times2d 12416	. . . 4 ⊢ (𝜑 → ((2↑𝑁) · 2) = ((2↑𝑁) + (2↑𝑁)))
219	216, 218	eqtrd 2776	. . 3 ⊢ (𝜑 → (2↑(𝑁 + 1)) = ((2↑𝑁) + (2↑𝑁)))
220	22	bitsinvp1 16413	. . . . . 6 ⊢ ((𝐴 ⊆ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) = ((𝐾‘(𝐴 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐴, (2↑𝑁), 0)))
221	10, 5, 220	syl2anc 591	. . . . 5 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) = ((𝐾‘(𝐴 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐴, (2↑𝑁), 0)))
222	22	bitsinvp1 16413	. . . . . 6 ⊢ ((𝐵 ⊆ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1)))) = ((𝐾‘(𝐵 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
223	31, 5, 222	syl2anc 591	. . . . 5 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1)))) = ((𝐾‘(𝐵 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))
224	221, 223	oveq12d 7377	. . . 4 ⊢ (𝜑 → ((𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) + (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1))))) = (((𝐾‘(𝐴 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐴, (2↑𝑁), 0)) + ((𝐾‘(𝐵 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
225	29	nn0cnd 12495	. . . . 5 ⊢ (𝜑 → (𝐾‘(𝐴 ∩ (0..^𝑁))) ∈ ℂ)
226	39	nn0cnd 12495	. . . . 5 ⊢ (𝜑 → (𝐾‘(𝐵 ∩ (0..^𝑁))) ∈ ℂ)
227	225, 195, 226, 182	add4d 11371	. . . 4 ⊢ (𝜑 → (((𝐾‘(𝐴 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐴, (2↑𝑁), 0)) + ((𝐾‘(𝐵 ∩ (0..^𝑁))) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))) = (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
228	224, 227	eqtrd 2776	. . 3 ⊢ (𝜑 → ((𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) + (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1))))) = (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0))))
229	219, 228	breq12d 5087	. 2 ⊢ (𝜑 → ((2↑(𝑁 + 1)) ≤ ((𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) + (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1))))) ↔ ((2↑𝑁) + (2↑𝑁)) ≤ (((𝐾‘(𝐴 ∩ (0..^𝑁))) + (𝐾‘(𝐵 ∩ (0..^𝑁)))) + (if(𝑁 ∈ 𝐴, (2↑𝑁), 0) + if(𝑁 ∈ 𝐵, (2↑𝑁), 0)))))
230	212, 214, 229	3bitr4d 313	1 ⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ (2↑(𝑁 + 1)) ≤ ((𝐾‘(𝐴 ∩ (0..^(𝑁 + 1)))) + (𝐾‘(𝐵 ∩ (0..^(𝑁 + 1)))))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 397 ∨ wo 854 = wceq 1548 caddwcad 1614 ∈ wcel 2121 ∩ cin 3883 ⊆ wss 3884 ∅c0 4263 ifcif 4456 𝒫 cpw 4531 class class class wbr 5074 ↦ cmpt 5155 ^◡ccnv 5619 ↾ cres 5622 ⟶wf 6484 –1-1-onto→wf1o 6487 ‘cfv 6488 (class class class)co 7359 ∈ cmpo 7361 1_oc1o 8392 2_oc2o 8393 Fincfn 8887 ℝcr 11033 0cc0 11034 1c1 11035 + caddc 11037 · cmul 11039 < clt 11175 ≤ cle 11176 − cmin 11373 ℕcn 12169 2c2 12231 ℕ₀cn0 12432 ℤcz 12519 ..^cfzo 13603 seqcseq 13958 ↑cexp 14018 bitscbits 16383

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-inf2 9557 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-xor 1520 df-tru 1551 df-fal 1561 df-cad 1615 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-disj 5042 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-isom 6497 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-er 8637 df-map 8769 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-oi 9419 df-dju 9820 df-card 9858 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-xnn0 12506 df-z 12520 df-uz 12784 df-rp 12938 df-fz 13457 df-fzo 13604 df-fl 13746 df-mod 13824 df-seq 13959 df-exp 14019 df-hash 14288 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-clim 15445 df-sum 15644 df-dvds 16217 df-bits 16386

This theorem is referenced by: sadcadd 16422

W3C validator