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

Theorem cantnfdm 9585
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 9584 . . 3 (𝜑 → (𝐴 CNF 𝐵) = (𝑓𝑆OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom )))
54dmeqd 5860 . 2 (𝜑 → dom (𝐴 CNF 𝐵) = dom (𝑓𝑆OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom )))
6 fvex 6853 . . . . 5 (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V
76csbex 5246 . . . 4 OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V
87rgenw 3055 . . 3 𝑓𝑆 OrdIso( E , (𝑓 supp ∅)) / (seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑘)) ·o (𝑓‘(𝑘))) +o 𝑧)), ∅)‘dom ) ∈ V
9 dmmptg 6206 . . 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, 10eqtrdi 2787 1 (𝜑 → dom (𝐴 CNF 𝐵) = 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  wral 3051  {crab 3389  Vcvv 3429  csb 3837  c0 4273   class class class wbr 5085  cmpt 5166   E cep 5530  dom cdm 5631  Oncon0 6323  cfv 6498  (class class class)co 7367  cmpo 7369   supp csupp 8110  seqωcseqom 8386   +o coa 8402   ·o comu 8403  o coe 8404  m cmap 8773   finSupp cfsupp 9274  OrdIsocoi 9424   CNF ccnf 9582
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-seqom 8387  df-cnf 9583
This theorem is referenced by:  cantnfs  9587  cantnfval  9589  cantnff  9595  oemapso  9603  wemapwe  9618  oef1o  9619
  Copyright terms: Public domain W3C validator