Theorem ackbij1lem9 9234

Description: Lemma for ackbij1 9244. (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 3969	. . . . . . . . . 10 ⊢ (𝒫 ω ∩ Fin) ⊆ Fin
2	1	sseli 3732	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → 𝐴 ∈ Fin)
3	2	3ad2ant1 1127	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ∈ Fin)
4		snfi 8195	. . . . . . . . . 10 ⊢ {𝑦} ∈ Fin
5		inss1 3968	. . . . . . . . . . . . . . . 16 ⊢ (𝒫 ω ∩ Fin) ⊆ 𝒫 ω
6	5	sseli 3732	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → 𝐴 ∈ 𝒫 ω)
7	6	elpwid 4306	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → 𝐴 ⊆ ω)
8	7	3ad2ant1 1127	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ⊆ ω)
9		onfin2 8309	. . . . . . . . . . . . . 14 ⊢ ω = (On ∩ Fin)
10		inss2 3969	. . . . . . . . . . . . . 14 ⊢ (On ∩ Fin) ⊆ Fin
11	9, 10	eqsstri 3768	. . . . . . . . . . . . 13 ⊢ ω ⊆ Fin
12	8, 11	syl6ss 3748	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐴 ⊆ Fin)
13	12	sselda 3736	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ Fin)
14		pwfi 8418	. . . . . . . . . . 11 ⊢ (𝑦 ∈ Fin ↔ 𝒫 𝑦 ∈ Fin)
15	13, 14	sylib 208	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐴) → 𝒫 𝑦 ∈ Fin)
16		xpfi 8388	. . . . . . . . . 10 ⊢ (({𝑦} ∈ Fin ∧ 𝒫 𝑦 ∈ Fin) → ({𝑦} × 𝒫 𝑦) ∈ Fin)
17	4, 15, 16	sylancr 698	. . . . . . . . 9 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐴) → ({𝑦} × 𝒫 𝑦) ∈ Fin)
18	17	ralrimiva 3096	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∀𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin)
19		iunfi 8411	. . . . . . . 8 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin) → ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin)
20	3, 18, 19	syl2anc 696	. . . . . . 7 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin)
21		ficardid 8970	. . . . . . 7 ⊢ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦))
22	20, 21	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦))
23	1	sseli 3732	. . . . . . . . 9 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → 𝐵 ∈ Fin)
24	23	3ad2ant2 1128	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ∈ Fin)
25	5	sseli 3732	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → 𝐵 ∈ 𝒫 ω)
26	25	elpwid 4306	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → 𝐵 ⊆ ω)
27	26	3ad2ant2 1128	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ⊆ ω)
28	27, 11	syl6ss 3748	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → 𝐵 ⊆ Fin)
29	28	sselda 3736	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ Fin)
30	29, 14	sylib 208	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐵) → 𝒫 𝑦 ∈ Fin)
31	4, 30, 16	sylancr 698	. . . . . . . . 9 ⊢ (((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) ∧ 𝑦 ∈ 𝐵) → ({𝑦} × 𝒫 𝑦) ∈ Fin)
32	31	ralrimiva 3096	. . . . . . . 8 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∀𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin)
33		iunfi 8411	. . . . . . . 8 ⊢ ((𝐵 ∈ Fin ∧ ∀𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin) → ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin)
34	24, 32, 33	syl2anc 696	. . . . . . 7 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin)
35		ficardid 8970	. . . . . . 7 ⊢ (∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))
36	34, 35	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))
37		cdaen 9179	. . . . . 6 ⊢ (((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∧ (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
38	22, 36, 37	syl2anc 696	. . . . 5 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
39		djudisj 5711	. . . . . . . 8 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∩ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) = ∅)
40	39	3ad2ant3 1129	. . . . . . 7 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∩ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) = ∅)
41		cdaun 9178	. . . . . . 7 ⊢ ((∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin ∧ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin ∧ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∩ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∪ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
42	20, 34, 40, 41	syl3anc 1473	. . . . . 6 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∪ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
43		iunxun 4749	. . . . . 6 ⊢ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦) = (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∪ ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))
44	42, 43	syl6breqr 4838	. . . . 5 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦))
45		entr 8165	. . . . 5 ⊢ ((((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∧ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) +𝑐 ∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦))
46	38, 44, 45	syl2anc 696	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦))
47		carden2b 8975	. . . 4 ⊢ (((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))) ≈ ∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
48	46, 47	syl 17	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
49		ficardom 8969	. . . . 5 ⊢ (∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ ω)
50	20, 49	syl 17	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ ω)
51		ficardom 8969	. . . . 5 ⊢ (∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦) ∈ Fin → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∈ ω)
52	34, 51	syl 17	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∈ ω)
53		nnacda 9207	. . . 4 ⊢ (((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ ω ∧ (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)) ∈ ω) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
54	50, 52, 53	syl2anc 696	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑐 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
55	48, 54	eqtr3d 2788	. 2 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
56		ackbij1lem6 9231	. . . 4 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin)) → (𝐴 ∪ 𝐵) ∈ (𝒫 ω ∩ Fin))
57	56	3adant3 1126	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∪ 𝐵) ∈ (𝒫 ω ∩ Fin))
58		ackbij.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
59	58	ackbij1lem7 9232	. . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ (𝒫 ω ∩ Fin) → (𝐹‘(𝐴 ∪ 𝐵)) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
60	57, 59	syl 17	. 2 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹‘(𝐴 ∪ 𝐵)) = (card‘∪ 𝑦 ∈ (𝐴 ∪ 𝐵)({𝑦} × 𝒫 𝑦)))
61	58	ackbij1lem7 9232	. . . 4 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝐴) = (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)))
62	58	ackbij1lem7 9232	. . . 4 ⊢ (𝐵 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝐵) = (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦)))
63	61, 62	oveqan12d 6824	. . 3 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin)) → ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
64	63	3adant3 1126	. 2 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)) = ((card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) +𝑜 (card‘∪ 𝑦 ∈ 𝐵 ({𝑦} × 𝒫 𝑦))))
65	55, 60, 64	3eqtr4d 2796	1 ⊢ ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝐵 ∈ (𝒫 ω ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹‘(𝐴 ∪ 𝐵)) = ((𝐹‘𝐴) +𝑜 (𝐹‘𝐵)))

Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1072   = wceq 1624   ∈ wcel 2131  ∀wral 3042   ∪ cun 3705   ∩ cin 3706   ⊆ wss 3707  ∅c0 4050  𝒫 cpw 4294  {csn 4313  ∪ ciun 4664   class class class wbr 4796   ↦ cmpt 4873   × cxp 5256  Oncon0 5876  ‘cfv 6041  (class class class)co 6805  ωcom 7222   +_𝑜 coa 7718   ≈ cen 8110  Fincfn 8113  cardccrd 8943   +_𝑐 ccda 9173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1863  ax-4 1878  ax-5 1980  ax-6 2046  ax-7 2082  ax-8 2133  ax-9 2140  ax-10 2160  ax-11 2175  ax-12 2188  ax-13 2383  ax-ext 2732  ax-rep 4915  ax-sep 4925  ax-nul 4933  ax-pow 4984  ax-pr 5047  ax-un 7106

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1627  df-ex 1846  df-nf 1851  df-sb 2039  df-eu 2603  df-mo 2604  df-clab 2739  df-cleq 2745  df-clel 2748  df-nfc 2883  df-ne 2925  df-ral 3047  df-rex 3048  df-reu 3049  df-rmo 3050  df-rab 3051  df-v 3334  df-sbc 3569  df-csb 3667  df-dif 3710  df-un 3712  df-in 3714  df-ss 3721  df-pss 3723  df-nul 4051  df-if 4223  df-pw 4296  df-sn 4314  df-pr 4316  df-tp 4318  df-op 4320  df-uni 4581  df-int 4620  df-iun 4666  df-br 4797  df-opab 4857  df-mpt 4874  df-tr 4897  df-id 5166  df-eprel 5171  df-po 5179  df-so 5180  df-fr 5217  df-we 5219  df-xp 5264  df-rel 5265  df-cnv 5266  df-co 5267  df-dm 5268  df-rn 5269  df-res 5270  df-ima 5271  df-pred 5833  df-ord 5879  df-on 5880  df-lim 5881  df-suc 5882  df-iota 6004  df-fun 6043  df-fn 6044  df-f 6045  df-f1 6046  df-fo 6047  df-f1o 6048  df-fv 6049  df-ov 6808  df-oprab 6809  df-mpt2 6810  df-om 7223  df-1st 7325  df-2nd 7326  df-wrecs 7568  df-recs 7629  df-rdg 7667  df-1o 7721  df-2o 7722  df-oadd 7725  df-er 7903  df-map 8017  df-en 8114  df-dom 8115  df-sdom 8116  df-fin 8117  df-card 8947  df-cda 9174

This theorem is referenced by:  ackbij1lem12  9237  ackbij1lem13  9238  ackbij1lem14  9239  ackbij1lem16  9241  ackbij1lem18  9243