Theorem ackbij1lem9 8933

Description: Lemma for ackbij1 8943. (Contributed by Stefan O'Rear, 19-Nov-2014.)

Hypothesis

Ref	Expression
ackbij.f	⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))

Assertion

Ref	Expression
ackbij1lem9	⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹‘(𝐴 ∪ 𝐵)) = ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem ackbij1lem9

Step	Hyp	Ref	Expression
1		inss2 3796	. . . . . . . . . 10 ⊢ (𝒫 ω ∩ Fin) ⊆ Fin
2	1	sseli 3564	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → 𝐴 ∈ Fin)
3	2	3ad2ant1 1075	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ∈ Fin)
4		snfi 7923	. . . . . . . . . 10 ⊢ {𝑦} ∈ Fin
5		inss1 3795	. . . . . . . . . . . . . . . 16 ⊢ (𝒫 ω ∩ Fin) ⊆ 𝒫 ω
6	5	sseli 3564	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → 𝐴 ∈ 𝒫 ω)
7	6	elpwid 4118	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → 𝐴 ⊆ ω)
8	7	3ad2ant1 1075	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ⊆ ω)
9		onfin2 8037	. . . . . . . . . . . . . 14 ⊢ ω = (On ∩ Fin)
10		inss2 3796	. . . . . . . . . . . . . 14 ⊢ (On ∩ Fin) ⊆ Fin
11	9, 10	eqsstri 3598	. . . . . . . . . . . . 13 ⊢ ω ⊆ Fin
12	8, 11	syl6ss 3580	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ⊆ Fin)
13	12	sselda 3568	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ Fin)
14		pwfi 8144	. . . . . . . . . . 11 ⊢ (𝑦 ∈ Fin ↔ 𝒫 𝑦 ∈ Fin)
15	13, 14	sylib 207	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐴) → 𝒫 𝑦 ∈ Fin)
16		xpfi 8116	. . . . . . . . . 10 ⊢ (({𝑦} ∈ Fin ∧ 𝒫 𝑦 ∈ Fin) → ({𝑦} × 𝒫 𝑦) ∈ Fin)
17	4, 15, 16	sylancr 694	. . . . . . . . 9 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐴) → ({𝑦} × 𝒫 𝑦) ∈ Fin)
18	17	ralrimiva 2949	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∀𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin)
19		iunfi 8137	. . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin) → ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin)
20	3, 18, 19	syl2anc 691	. . . . . . 7 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin)
21		ficardid 8671	. . . . . . 7 ⊢ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦))
22	20, 21	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦))
23	1	sseli 3564	. . . . . . . . 9 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → 𝐵 ∈ Fin)
24	23	3ad2ant2 1076	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ∈ Fin)
25	5	sseli 3564	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → 𝐵 ∈ 𝒫 ω)
26	25	elpwid 4118	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → 𝐵 ⊆ ω)
27	26	3ad2ant2 1076	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ⊆ ω)
28	27, 11	syl6ss 3580	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ⊆ Fin)
29	28	sselda 3568	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ Fin)
30	29, 14	sylib 207	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐵) → 𝒫 𝑦 ∈ Fin)
31	4, 30, 16	sylancr 694	. . . . . . . . 9 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐵) → ({𝑦} × 𝒫 𝑦) ∈ Fin)
32	31	ralrimiva 2949	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∀𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin)
33		iunfi 8137	. . . . . . . 8 ⊢ ((𝐵 ∈ Fin ∧ ∀𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin) → ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin)
34	24, 32, 33	syl2anc 691	. . . . . . 7 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin)
35		ficardid 8671	. . . . . . 7 ⊢ (∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))
36	34, 35	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))
37		cdaen 8878	. . . . . 6 ⊢ (((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∧ (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
38	22, 36, 37	syl2anc 691	. . . . 5 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
39		djudisj 5480	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∩ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) = ∅)
40	39	3ad2ant3 1077	. . . . . . 7 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∩ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) = ∅)
41		cdaun 8877	. . . . . . 7 ⊢ ((∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin ∧ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin ∧ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∩ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∪ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
42	20, 34, 40, 41	syl3anc 1318	. . . . . 6 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∪ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
43		iunxun 4541	. . . . . 6 ⊢ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦) = (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∪ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))
44	42, 43	syl6breqr 4625	. . . . 5 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦))
45		entr 7894	. . . . 5 ⊢ ((((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∧ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦))
46	38, 44, 45	syl2anc 691	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦))
47		carden2b 8676	. . . 4 ⊢ (((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
48	46, 47	syl 17	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
49		ficardom 8670	. . . . 5 ⊢ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ ω)
50	20, 49	syl 17	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ ω)
51		ficardom 8670	. . . . 5 ⊢ (∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∈ ω)
52	34, 51	syl 17	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∈ ω)
53		nnacda 8906	. . . 4 ⊢ (((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ ω ∧ (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∈ ω) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
54	50, 52, 53	syl2anc 691	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
55	48, 54	eqtr3d 2646	. 2 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
56		ackbij1lem6 8930	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin)) → (𝐴 ∪ 𝐵) ∈ (𝒫 ω ∩ Fin))
57	56	3adant3 1074	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∪ 𝐵) ∈ (𝒫 ω ∩ Fin))
58		ackbij.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
59	58	ackbij1lem7 8931	. . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ (𝒫 ω ∩ Fin) → (𝐹‘(𝐴 ∪ 𝐵)) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
60	57, 59	syl 17	. 2 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹‘(𝐴 ∪ 𝐵)) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
61	58	ackbij1lem7 8931	. . . 4 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝐴) = (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)))
62	58	ackbij1lem7 8931	. . . 4 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝐵) = (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
63	61, 62	oveqan12d 6568	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin)) → ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
64	63	3adant3 1074	. 2 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
65	55, 60, 64	3eqtr4d 2654	1 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹‘(𝐴 ∪ 𝐵)) = ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)))

Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∀wral 2896   ∪ cun 3538   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  𝒫 cpw 4108  {csn 4125  ∪ ciun 4455   class class class wbr 4583   ↦ cmpt 4643   × cxp 5036  Oncon0 5640  ‘cfv 5804  (class class class)co 6549  ωcom 6957   +_𝑜 coa 7444   ≈ cen 7838  Fincfn 7841  cardccrd 8644   +_𝑐 ccda 8872

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873

This theorem is referenced by:  ackbij1lem12  8936  ackbij1lem13  8937  ackbij1lem14  8938  ackbij1lem16  8940  ackbij1lem18  8942