| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij2 10330. (Contributed by Stefan O'Rear, 19-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij1lem4 | ⊢ (𝐴 ∈ ω → {𝐴} ∈ (𝒫 ω ∩ Fin)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snelpwi 5415 | . 2 ⊢ (𝐴 ∈ ω → {𝐴} ∈ 𝒫 ω) | |
| 2 | snfi 9082 | . . 3 ⊢ {𝐴} ∈ Fin | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝐴 ∈ ω → {𝐴} ∈ Fin) |
| 4 | 1, 3 | elind 4099 | 1 ⊢ (𝐴 ∈ ω → {𝐴} ∈ (𝒫 ω ∩ Fin)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2146 ∩ cin 4091 𝒫 cpw 4559 {csn 4587 ωcom 7884 Fincfn 8984 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-om 7885 df-1o 8487 df-en 8985 df-fin 8988 |
| This theorem is used by: ackbij1lem8 10314 ackbij1lem14 10320 ackbij1lem16 10322 ackbij1lem18 10324 |
| Copyright terms: Public domain | W3C validator |