| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij2 10320. (Contributed by Stefan O'Rear, 19-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij1lem4 | ⊢ (𝐴 ∈ ω → {𝐴} ∈ (𝒫 ω ∩ Fin)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snelpwi 5412 | . 2 ⊢ (𝐴 ∈ ω → {𝐴} ∈ 𝒫 ω) | |
| 2 | snfi 9071 | . . 3 ⊢ {𝐴} ∈ Fin | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝐴 ∈ ω → {𝐴} ∈ Fin) |
| 4 | 1, 3 | elind 4146 | 1 ⊢ (𝐴 ∈ ω → {𝐴} ∈ (𝒫 ω ∩ Fin)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 ∩ cin 3898 𝒫 cpw 4557 {csn 4584 ωcom 7877 Fincfn 8973 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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-sb 2100 df-mo 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-om 7878 df-1o 8476 df-en 8974 df-fin 8977 |
| This theorem is used by: ackbij1lem8 10304 ackbij1lem14 10310 ackbij1lem16 10312 ackbij1lem18 10314 |
| Copyright terms: Public domain | W3C validator |