| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cantnfdm | Structured version Visualization version GIF version | ||
| Description: The domain of the Cantor normal form function (in later lemmas we will use dom (𝐴 CNF 𝐵) to abbreviate "the set of finitely supported functions from 𝐵 to 𝐴"). (Contributed by Mario Carneiro, 25-May-2015.) (Revised by AV, 28-Jun-2019.) |
| Ref | Expression |
|---|---|
| cantnffval.s | ⊢ 𝑆 = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} |
| cantnffval.a | ⊢ (𝜑 → 𝐴 ∈ On) |
| cantnffval.b | ⊢ (𝜑 → 𝐵 ∈ On) |
| Ref | Expression |
|---|---|
| cantnfdm | ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cantnffval.s | . . . 4 ⊢ 𝑆 = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} | |
| 2 | cantnffval.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ On) | |
| 3 | cantnffval.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ On) | |
| 4 | 1, 2, 3 | cantnffval 9632 | . . 3 ⊢ (𝜑 → (𝐴 CNF 𝐵) = (𝑓 ∈ 𝑆 ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ))) |
| 5 | 4 | dmeqd 5896 | . 2 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = dom (𝑓 ∈ 𝑆 ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ))) |
| 6 | fvex 6895 | . . . . 5 ⊢ (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V | |
| 7 | 6 | csbex 5276 | . . . 4 ⊢ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V |
| 8 | 7 | rgenw 3089 | . . 3 ⊢ ∀𝑓 ∈ 𝑆 ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V |
| 9 | dmmptg 6244 | . . 3 ⊢ (∀𝑓 ∈ 𝑆 ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V → dom (𝑓 ∈ 𝑆 ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ)) = 𝑆) | |
| 10 | 8, 9 | ax-mp 5 | . 2 ⊢ dom (𝑓 ∈ 𝑆 ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ)) = 𝑆 |
| 11 | 5, 10 | eqtrdi 2820 | 1 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = 𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 ∀wral 3085 {crab 3423 Vcvv 3463 ⦋csb 3861 ∅c0 4294 class class class wbr 5113 ↦ cmpt 5196 E cep 5561 dom cdm 5662 Oncon0 6361 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 supp csupp 8156 seqωcseqom 8434 +o coa 8450 ·o comu 8451 ↑o coe 8452 ↑m cmap 8824 finSupp cfsupp 9321 OrdIsocoi 9471 CNF ccnf 9630 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-seqom 8435 df-cnf 9631 |
| This theorem is referenced by: cantnfs 9635 cantnfval 9637 cantnff 9643 oemapso 9651 wemapwe 9666 oef1o 9667 |
| Copyright terms: Public domain | W3C validator |