MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cantnfdm Structured version   Visualization version   GIF version

Theorem cantnfdm 9127
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.)
Hypotheses
Ref Expression
cantnffval.s 𝑆 = {𝑔 ∈ (𝐴m 𝐵) ∣ 𝑔 finSupp ∅}
cantnffval.a (𝜑𝐴 ∈ On)
cantnffval.b (𝜑𝐵 ∈ On)
Assertion
Ref Expression
cantnfdm (𝜑 → dom (𝐴 CNF 𝐵) = 𝑆)
Distinct variable groups:   𝐴,𝑔   𝐵,𝑔
Allowed substitution hints:   𝜑(𝑔)   𝑆(𝑔)

Proof of Theorem cantnfdm
Dummy variables 𝑓 𝑘 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cantnffval.s . . . 4 𝑆 = {𝑔 ∈ (𝐴m 𝐵) ∣ 𝑔 finSupp ∅}
2 cantnffval.a . . . 4 (𝜑𝐴 ∈ On)
3 cantnffval.b . . . 4 (𝜑𝐵 ∈ On)
41, 2, 3cantnffval 9126 . . 3 (𝜑 → (𝐴 CNF 𝐵) = (𝑓𝑆OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom )))
54dmeqd 5774 . 2 (𝜑 → dom (𝐴 CNF 𝐵) = dom (𝑓𝑆OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom )))
6 fvex 6683 . . . . 5 (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V
76csbex 5215 . . . 4 OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V
87rgenw 3150 . . 3 𝑓𝑆 OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V
9 dmmptg 6096 . . 3 (∀𝑓𝑆 OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V → dom (𝑓𝑆OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom )) = 𝑆)
108, 9ax-mp 5 . 2 dom (𝑓𝑆OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom )) = 𝑆
115, 10syl6eq 2872 1 (𝜑 → dom (𝐴 CNF 𝐵) = 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  wral 3138  {crab 3142  Vcvv 3494  csb 3883  c0 4291   class class class wbr 5066  cmpt 5146   E cep 5464  dom cdm 5555  Oncon0 6191  cfv 6355  (class class class)co 7156  cmpo 7158   supp csupp 7830  seqωcseqom 8083   +o coa 8099   ·o comu 8100  o coe 8101  m cmap 8406   finSupp cfsupp 8833  OrdIsocoi 8973   CNF ccnf 9124
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-seqom 8084  df-cnf 9125
This theorem is referenced by:  cantnfs  9129  cantnfval  9131  cantnff  9137  oemapso  9145  wemapwe  9160  oef1o  9161
  Copyright terms: Public domain W3C validator