| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem8 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij1 10154. (Contributed by Stefan O'Rear, 19-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij.f | ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦))) |
| Ref | Expression |
|---|---|
| ackbij1lem8 | ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sneq 4578 | . . . 4 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
| 2 | 1 | fveq2d 6840 | . . 3 ⊢ (𝑎 = 𝐴 → (𝐹‘{𝑎}) = (𝐹‘{𝐴})) |
| 3 | pweq 4556 | . . . 4 ⊢ (𝑎 = 𝐴 → 𝒫 𝑎 = 𝒫 𝐴) | |
| 4 | 3 | fveq2d 6840 | . . 3 ⊢ (𝑎 = 𝐴 → (card‘𝒫 𝑎) = (card‘𝒫 𝐴)) |
| 5 | 2, 4 | eqeq12d 2753 | . 2 ⊢ (𝑎 = 𝐴 → ((𝐹‘{𝑎}) = (card‘𝒫 𝑎) ↔ (𝐹‘{𝐴}) = (card‘𝒫 𝐴))) |
| 6 | ackbij1lem4 10139 | . . . 4 ⊢ (𝑎 ∈ ω → {𝑎} ∈ (𝒫 ω ∩ Fin)) | |
| 7 | ackbij.f | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦))) | |
| 8 | 7 | ackbij1lem7 10142 | . . . 4 ⊢ ({𝑎} ∈ (𝒫 ω ∩ Fin) → (𝐹‘{𝑎}) = (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦))) |
| 9 | 6, 8 | syl 17 | . . 3 ⊢ (𝑎 ∈ ω → (𝐹‘{𝑎}) = (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦))) |
| 10 | vex 3434 | . . . . . 6 ⊢ 𝑎 ∈ V | |
| 11 | sneq 4578 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → {𝑦} = {𝑎}) | |
| 12 | pweq 4556 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → 𝒫 𝑦 = 𝒫 𝑎) | |
| 13 | 11, 12 | xpeq12d 5657 | . . . . . 6 ⊢ (𝑦 = 𝑎 → ({𝑦} × 𝒫 𝑦) = ({𝑎} × 𝒫 𝑎)) |
| 14 | 10, 13 | iunxsn 5034 | . . . . 5 ⊢ ∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦) = ({𝑎} × 𝒫 𝑎) |
| 15 | 14 | fveq2i 6839 | . . . 4 ⊢ (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦)) = (card‘({𝑎} × 𝒫 𝑎)) |
| 16 | vpwex 5316 | . . . . . 6 ⊢ 𝒫 𝑎 ∈ V | |
| 17 | xpsnen2g 9003 | . . . . . 6 ⊢ ((𝑎 ∈ V ∧ 𝒫 𝑎 ∈ V) → ({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎) | |
| 18 | 10, 16, 17 | mp2an 693 | . . . . 5 ⊢ ({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎 |
| 19 | carden2b 9886 | . . . . 5 ⊢ (({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎 → (card‘({𝑎} × 𝒫 𝑎)) = (card‘𝒫 𝑎)) | |
| 20 | 18, 19 | ax-mp 5 | . . . 4 ⊢ (card‘({𝑎} × 𝒫 𝑎)) = (card‘𝒫 𝑎) |
| 21 | 15, 20 | eqtri 2760 | . . 3 ⊢ (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦)) = (card‘𝒫 𝑎) |
| 22 | 9, 21 | eqtrdi 2788 | . 2 ⊢ (𝑎 ∈ ω → (𝐹‘{𝑎}) = (card‘𝒫 𝑎)) |
| 23 | 5, 22 | vtoclga 3521 | 1 ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∩ cin 3889 𝒫 cpw 4542 {csn 4568 ∪ ciun 4934 class class class wbr 5086 ↦ cmpt 5167 × cxp 5624 ‘cfv 6494 ωcom 7812 ≈ cen 8885 Fincfn 8888 cardccrd 9854 |
| 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 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-om 7813 df-1st 7937 df-2nd 7938 df-1o 8400 df-er 8638 df-en 8889 df-fin 8892 df-card 9858 |
| This theorem is referenced by: ackbij1lem14 10149 ackbij1b 10155 |
| Copyright terms: Public domain | W3C validator |