| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem8 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij1 10138. (Contributed by Stefan O'Rear, 19-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij.f | ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦))) |
| Ref | Expression |
|---|---|
| ackbij1lem8 | ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sneq 4587 | . . . 4 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
| 2 | 1 | fveq2d 6835 | . . 3 ⊢ (𝑎 = 𝐴 → (𝐹‘{𝑎}) = (𝐹‘{𝐴})) |
| 3 | pweq 4565 | . . . 4 ⊢ (𝑎 = 𝐴 → 𝒫 𝑎 = 𝒫 𝐴) | |
| 4 | 3 | fveq2d 6835 | . . 3 ⊢ (𝑎 = 𝐴 → (card‘𝒫 𝑎) = (card‘𝒫 𝐴)) |
| 5 | 2, 4 | eqeq12d 2749 | . 2 ⊢ (𝑎 = 𝐴 → ((𝐹‘{𝑎}) = (card‘𝒫 𝑎) ↔ (𝐹‘{𝐴}) = (card‘𝒫 𝐴))) |
| 6 | ackbij1lem4 10123 | . . . 4 ⊢ (𝑎 ∈ ω → {𝑎} ∈ (𝒫 ω ∩ Fin)) | |
| 7 | ackbij.f | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦))) | |
| 8 | 7 | ackbij1lem7 10126 | . . . 4 ⊢ ({𝑎} ∈ (𝒫 ω ∩ Fin) → (𝐹‘{𝑎}) = (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦))) |
| 9 | 6, 8 | syl 17 | . . 3 ⊢ (𝑎 ∈ ω → (𝐹‘{𝑎}) = (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦))) |
| 10 | vex 3442 | . . . . . 6 ⊢ 𝑎 ∈ V | |
| 11 | sneq 4587 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → {𝑦} = {𝑎}) | |
| 12 | pweq 4565 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → 𝒫 𝑦 = 𝒫 𝑎) | |
| 13 | 11, 12 | xpeq12d 5652 | . . . . . 6 ⊢ (𝑦 = 𝑎 → ({𝑦} × 𝒫 𝑦) = ({𝑎} × 𝒫 𝑎)) |
| 14 | 10, 13 | iunxsn 5043 | . . . . 5 ⊢ ∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦) = ({𝑎} × 𝒫 𝑎) |
| 15 | 14 | fveq2i 6834 | . . . 4 ⊢ (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦)) = (card‘({𝑎} × 𝒫 𝑎)) |
| 16 | vpwex 5319 | . . . . . 6 ⊢ 𝒫 𝑎 ∈ V | |
| 17 | xpsnen2g 8993 | . . . . . 6 ⊢ ((𝑎 ∈ V ∧ 𝒫 𝑎 ∈ V) → ({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎) | |
| 18 | 10, 16, 17 | mp2an 692 | . . . . 5 ⊢ ({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎 |
| 19 | carden2b 9870 | . . . . 5 ⊢ (({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎 → (card‘({𝑎} × 𝒫 𝑎)) = (card‘𝒫 𝑎)) | |
| 20 | 18, 19 | ax-mp 5 | . . . 4 ⊢ (card‘({𝑎} × 𝒫 𝑎)) = (card‘𝒫 𝑎) |
| 21 | 15, 20 | eqtri 2756 | . . 3 ⊢ (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦)) = (card‘𝒫 𝑎) |
| 22 | 9, 21 | eqtrdi 2784 | . 2 ⊢ (𝑎 ∈ ω → (𝐹‘{𝑎}) = (card‘𝒫 𝑎)) |
| 23 | 5, 22 | vtoclga 3530 | 1 ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ∩ cin 3898 𝒫 cpw 4551 {csn 4577 ∪ ciun 4943 class class class wbr 5095 ↦ cmpt 5176 × cxp 5619 ‘cfv 6489 ωcom 7805 ≈ cen 8875 Fincfn 8878 cardccrd 9838 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-om 7806 df-1st 7930 df-2nd 7931 df-1o 8394 df-er 8631 df-en 8879 df-fin 8882 df-card 9842 |
| This theorem is referenced by: ackbij1lem14 10133 ackbij1b 10139 |
| Copyright terms: Public domain | W3C validator |