| 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 11196), see hashpwfi 11250. (Contributed by Jim Kingdon, 18-May-2026.) |
| Ref | Expression |
|---|---|
| 2omapfi | ⊢ (𝐴 ∈ Fin → (2o ↑𝑚 𝐴) ≈ (𝒫 𝐴 ∩ Fin)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2omapen 7312 | . 2 ⊢ (𝐴 ∈ Fin → (2o ↑𝑚 𝐴) ≈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥}) | |
| 2 | eqid 2238 | . . . . 5 ⊢ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} = {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} | |
| 3 | pwexg 4315 | . . . . 5 ⊢ (𝐴 ∈ Fin → 𝒫 𝐴 ∈ V) | |
| 4 | 2, 3 | rabexd 4279 | . . . 4 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ∈ V) |
| 5 | simpll 531 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝐴 ∈ Fin) | |
| 6 | elpwi 3697 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝒫 𝐴 → 𝑥 ⊆ 𝐴) | |
| 7 | 6 | ad2antlr 493 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝑥 ⊆ 𝐴) |
| 8 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) | |
| 9 | ssfidc 7238 | . . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝑥 ∈ Fin) | |
| 10 | 5, 7, 8, 9 | syl3anc 1278 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) → 𝑥 ∈ Fin) |
| 11 | 6 | ad2antlr 493 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → 𝑥 ⊆ 𝐴) |
| 12 | simpll 531 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → 𝐴 ∈ Fin) | |
| 13 | simpr 110 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → 𝑥 ∈ Fin) | |
| 14 | fissfi 7256 | . . . . . . 7 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝑥 ∈ Fin) → ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) | |
| 15 | 11, 12, 13, 14 | syl3anc 1278 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ∈ Fin) → ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥) |
| 16 | 10, 15 | impbida 604 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝑥 ∈ 𝒫 𝐴) → (∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥 ↔ 𝑥 ∈ Fin)) |
| 17 | 16 | rabbidva 2809 | . . . 4 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} = {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin}) |
| 18 | eqeng 7045 | . . . 4 ⊢ ({𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ∈ V → ({𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} = {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin} → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin})) | |
| 19 | 4, 17, 18 | sylc 62 | . . 3 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin}) |
| 20 | dfin5 3227 | . . 3 ⊢ (𝒫 𝐴 ∩ Fin) = {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ∈ Fin} | |
| 21 | 19, 20 | breqtrrdi 4170 | . 2 ⊢ (𝐴 ∈ Fin → {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ (𝒫 𝐴 ∩ Fin)) |
| 22 | entr 7064 | . 2 ⊢ (((2o ↑𝑚 𝐴) ≈ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ∧ {𝑥 ∈ 𝒫 𝐴 ∣ ∀𝑦 ∈ 𝐴 DECID 𝑦 ∈ 𝑥} ≈ (𝒫 𝐴 ∩ Fin)) → (2o ↑𝑚 𝐴) ≈ (𝒫 𝐴 ∩ Fin)) | |
| 23 | 1, 21, 22 | syl2anc 415 | 1 ⊢ (𝐴 ∈ Fin → (2o ↑𝑚 𝐴) ≈ (𝒫 𝐴 ∩ Fin)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 DECID wdc 846 = wceq 1402 ∈ wcel 2209 ∀wral 2528 {crab 2532 Vcvv 2821 ∩ cin 3219 ⊆ wss 3220 𝒫 cpw 3688 class class class wbr 4128 (class class class)co 6078 2oc2o 6674 ↑𝑚 cmap 6915 ≈ cen 7013 Fincfn 7015 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-13 2211 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-ov 6081 df-oprab 6082 df-mpo 6083 df-1st 6367 df-2nd 6368 df-1o 6680 df-2o 6681 df-er 6800 df-map 6917 df-en 7016 df-fin 7018 |
| This theorem is referenced by: fipwfi 7314 hashpwfi 11250 |
| Copyright terms: Public domain | W3C validator |