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 9525 | . . 3 ⊢ (𝜑 → (𝐴 CNF 𝐵) = (𝑓 ∈ 𝑆 ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ))) |
5 | 4 | dmeqd 5852 | . 2 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = dom (𝑓 ∈ 𝑆 ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ))) |
6 | fvex 6843 | . . . . 5 ⊢ (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V | |
7 | 6 | csbex 5260 | . . . 4 ⊢ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V |
8 | 7 | rgenw 3066 | . . 3 ⊢ ∀𝑓 ∈ 𝑆 ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (ℎ‘𝑘)) ·o (𝑓‘(ℎ‘𝑘))) +o 𝑧)), ∅)‘dom ℎ) ∈ V |
9 | dmmptg 6185 | . . 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 2793 | 1 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 ∀wral 3062 {crab 3404 Vcvv 3442 ⦋csb 3847 ∅c0 4274 class class class wbr 5097 ↦ cmpt 5180 E cep 5528 dom cdm 5625 Oncon0 6307 ‘cfv 6484 (class class class)co 7342 ∈ cmpo 7344 supp csupp 8052 seqωcseqom 8353 +o coa 8369 ·o comu 8370 ↑o coe 8371 ↑m cmap 8691 finSupp cfsupp 9231 OrdIsocoi 9371 CNF ccnf 9523 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-rep 5234 ax-sep 5248 ax-nul 5255 ax-pr 5377 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3351 df-rab 3405 df-v 3444 df-sbc 3732 df-csb 3848 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4275 df-if 4479 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4858 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5181 df-id 5523 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6243 df-iota 6436 df-fun 6486 df-fn 6487 df-f 6488 df-f1 6489 df-fo 6490 df-f1o 6491 df-fv 6492 df-ov 7345 df-oprab 7346 df-mpo 7347 df-frecs 8172 df-wrecs 8203 df-recs 8277 df-rdg 8316 df-seqom 8354 df-cnf 9524 |
This theorem is referenced by: cantnfs 9528 cantnfval 9530 cantnff 9536 oemapso 9544 wemapwe 9559 oef1o 9560 |
Copyright terms: Public domain | W3C validator |