Theorem ackbij1lem7 10147

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

Hypothesis

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

Assertion

Ref	Expression
ackbij1lem7	⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝐴) = (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)))

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

Proof of Theorem ackbij1lem7

Step	Hyp	Ref	Expression
1		iuneq1 4965	. . 3 ⊢ (𝑥 = 𝐴 → ∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦) = ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦))
2	1	fveq2d 6846	. 2 ⊢ (𝑥 = 𝐴 → (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)) = (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)))
3		ackbij.f	. 2 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
4		fvex 6855	. 2 ⊢ (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)) ∈ V
5	2, 3, 4	fvmpt 6949	1 ⊢ (𝐴 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝐴) = (card‘∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝒫 𝑦)))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114   ∩ cin 3902  𝒫 cpw 4556  {csn 4582  ∪ ciun 4948   ↦ cmpt 5181   × cxp 5630  ‘cfv 6500  ωcom 7818  Fincfn 8895  cardccrd 9859

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508

This theorem is referenced by:  ackbij1lem8  10148  ackbij1lem9  10149