| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 2omapfi | GIF version | ||
| Description: The number of finite subsets of a finite set. For a similar theorem with set size expressed using ♯ (df-ihash 11143), see hashpwfi 11197. (Contributed by Jim Kingdon, 18-May-2026.) |
| Ref | Expression |
|---|---|
| 2omapfi | ⊢ (𝐴 ∈ Fin → (2o ↑𝑚 𝐴) ≈ (𝒫 𝐴 ∩ Fin)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2omapen 7272 | . 2 ⊢ (𝐴 ∈ Fin → (2o ↑𝑚 𝐴) ≈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥}) | |
| 2 | eqid 2234 | . . . . 5 ⊢ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} = {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} | |
| 3 | pwexg 4295 | . . . . 5 ⊢ (𝐴 ∈ Fin → 𝒫 𝐴 ∈ V) | |
| 4 | 2, 3 | rabexd 4259 | . . . 4 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ∈ V) |
| 5 | simpll 527 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝐴 ∈ Fin) | |
| 6 | elpwi 3680 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴) | |
| 7 | 6 | ad2antlr 489 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝑥 ⊆ 𝐴) |
| 8 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) | |
| 9 | ssfidc 7200 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝑥 ∈ Fin) | |
| 10 | 5, 7, 8, 9 | syl3anc 1274 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝑥 ∈ Fin) |
| 11 | 6 | ad2antlr 489 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → 𝑥 ⊆ 𝐴) |
| 12 | simpll 527 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → 𝐴 ∈ Fin) | |
| 13 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → 𝑥 ∈ Fin) | |
| 14 | fissfi 7218 | . . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝑥 ∈ Fin) → ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) | |
| 15 | 11, 12, 13, 14 | syl3anc 1274 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) |
| 16 | 10, 15 | impbida 600 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) → (∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥 ↔ 𝑥 ∈ Fin)) |
| 17 | 16 | rabbidva 2803 | . . . 4 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} = {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin}) |
| 18 | eqeng 7007 | . . . 4 ⊢ ({𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ∈ V → ({𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} = {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin} → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin})) | |
| 19 | 4, 17, 18 | sylc 62 | . . 3 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin}) |
| 20 | dfin5 3220 | . . 3 ⊢ (𝒫 𝐴 ∩ Fin) = {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin} | |
| 21 | 19, 20 | breqtrrdi 4153 | . 2 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ (𝒫 𝐴 ∩ Fin)) |
| 22 | entr 7026 | . 2 ⊢ (((2o ↑𝑚 𝐴) ≈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ∧ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ (𝒫 𝐴 ∩ Fin)) → (2o ↑𝑚 𝐴) ≈ (𝒫 𝐴 ∩ Fin)) | |
| 23 | 1, 21, 22 | syl2anc 411 | 1 ⊢ (𝐴 ∈ Fin → (2o ↑𝑚 𝐴) ≈ (𝒫 𝐴 ∩ Fin)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 842 = wceq 1398 ∈ wcel 2205 ∀wral 2522 {crab 2526 Vcvv 2815 ∩ cin 3212 ⊆ wss 3213 𝒫 cpw 3671 class class class wbr 4111 (class class class)co 6052 2oc2o 6643 ↑𝑚 cmap 6884 ≈ cen 6975 Fincfn 6977 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-1o 6649 df-2o 6650 df-er 6769 df-map 6886 df-en 6978 df-fin 6980 |
| This theorem is referenced by: fipwfi 7274 hashpwfi 11197 |
| Copyright terms: Public domain | W3C validator |