| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem8 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij1 10339. (Contributed by Stefan O'Rear, 19-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij.f | ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦))) |
| Ref | Expression |
|---|---|
| ackbij1lem8 | ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sneq 4594 | . . . 4 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴}) | |
| 2 | 1 | fveq2d 6909 | . . 3 ⊢ (𝑎 = 𝐴 → (𝐹‘{𝑎}) = (𝐹‘{𝐴})) |
| 3 | pweq 4574 | . . . 4 ⊢ (𝑎 = 𝐴 → 𝒫 𝑎 = 𝒫 𝐴) | |
| 4 | 3 | fveq2d 6909 | . . 3 ⊢ (𝑎 = 𝐴 → (card‘𝒫 𝑎) = (card‘𝒫 𝐴)) |
| 5 | 2, 4 | eqeq12d 2779 | . 2 ⊢ (𝑎 = 𝐴 → ((𝐹‘{𝑎}) = (card‘𝒫 𝑎) ↔ (𝐹‘{𝐴}) = (card‘𝒫 𝐴))) |
| 6 | ackbij1lem4 10324 | . . . 4 ⊢ (𝑎 ∈ ω → {𝑎} ∈ (𝒫 ω ∩ Fin)) | |
| 7 | ackbij.f | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦))) | |
| 8 | 7 | ackbij1lem7 10327 | . . . 4 ⊢ ({𝑎} ∈ (𝒫 ω ∩ Fin) → (𝐹‘{𝑎}) = (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦))) |
| 9 | 6, 8 | syl 18 | . . 3 ⊢ (𝑎 ∈ ω → (𝐹‘{𝑎}) = (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦))) |
| 10 | vex 3458 | . . . . . 6 ⊢ 𝑎 ∈ V | |
| 11 | sneq 4594 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → {𝑦} = {𝑎}) | |
| 12 | pweq 4574 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → 𝒫 𝑦 = 𝒫 𝑎) | |
| 13 | 11, 12 | xpeq12d 5686 | . . . . . 6 ⊢ (𝑦 = 𝑎 → ({𝑦} × 𝒫 𝑦) = ({𝑎} × 𝒫 𝑎)) |
| 14 | 10, 13 | iunxsn 5054 | . . . . 5 ⊢ ∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦) = ({𝑎} × 𝒫 𝑎) |
| 15 | 14 | fveq2i 6908 | . . . 4 ⊢ (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦)) = (card‘({𝑎} × 𝒫 𝑎)) |
| 16 | vpwex 5343 | . . . . . 6 ⊢ 𝒫 𝑎 ∈ V | |
| 17 | xpsnen2g 9114 | . . . . . 6 ⊢ ((𝑎 ∈ V ∧ 𝒫 𝑎 ∈ V) → ({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎) | |
| 18 | 10, 16, 17 | mp2an 705 | . . . . 5 ⊢ ({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎 |
| 19 | carden2b 10072 | . . . . 5 ⊢ (({𝑎} × 𝒫 𝑎) ≈ 𝒫 𝑎 → (card‘({𝑎} × 𝒫 𝑎)) = (card‘𝒫 𝑎)) | |
| 20 | 18, 19 | ax-mp 5 | . . . 4 ⊢ (card‘({𝑎} × 𝒫 𝑎)) = (card‘𝒫 𝑎) |
| 21 | 15, 20 | eqtri 2786 | . . 3 ⊢ (card‘∪ 𝑦 ∈ {𝑎} ({𝑦} × 𝒫 𝑦)) = (card‘𝒫 𝑎) |
| 22 | 9, 21 | eqtrdi 2814 | . 2 ⊢ (𝑎 ∈ ω → (𝐹‘{𝑎}) = (card‘𝒫 𝑎)) |
| 23 | 5, 22 | vtoclga 3540 | 1 ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∩ cin 4092 𝒫 cpw 4560 {csn 4588 ∪ ciun 4954 class class class wbr 5106 ↦ cmpt 5189 × cxp 5653 ‘cfv 6555 ωcom 7898 ≈ cen 8995 Fincfn 8998 cardccrd 10040 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-om 7899 df-1st 8022 df-2nd 8023 df-1o 8501 df-er 8742 df-en 8999 df-fin 9002 df-card 10044 |
| This theorem is used by: ackbij1lem14 10334 ackbij1b 10340 |
| Copyright terms: Public domain | W3C validator |