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

Theorem cnfcom3c 9618
Description: Wrap the construction of cnfcom3 9616 into an existential quantifier. For any ω ⊆ 𝑏, there is a bijection from 𝑏 to some power of ω. Furthermore, this bijection is canonical , which means that we can find a single function 𝑔 which will give such bijections for every 𝑏 less than some arbitrarily large bound 𝐴. (Contributed by Mario Carneiro, 30-May-2015.)
Assertion
Ref Expression
cnfcom3c (𝐴 ∈ On → ∃𝑔𝑏𝐴 (ω ⊆ 𝑏 → ∃𝑤 ∈ (On ∖ 1o)(𝑔𝑏):𝑏1-1-onto→(ω ↑o 𝑤)))
Distinct variable group:   𝑔,𝑏,𝑤,𝐴

Proof of Theorem cnfcom3c
Dummy variables 𝑓 𝑘 𝑢 𝑣 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2737 . 2 dom (ω CNF 𝐴) = dom (ω CNF 𝐴)
2 eqid 2737 . 2 ((ω CNF 𝐴)‘𝑏) = ((ω CNF 𝐴)‘𝑏)
3 eqid 2737 . 2 OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)) = OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))
4 eqid 2737 . 2 seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑧)), ∅)
5 eqid 2737 . 2 seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))), ∅) = seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))), ∅)
6 eqid 2737 . 2 ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) = ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)))
7 eqid 2737 . 2 ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥))) = ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))
8 eqid 2737 . 2 (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))) = (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))
9 eqid 2737 . 2 (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑣) +o 𝑢)) = (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑣) +o 𝑢))
10 eqid 2737 . 2 (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑢) +o 𝑣)) = (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑢) +o 𝑣))
11 eqid 2737 . 2 (((𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑣) +o 𝑢)) ∘ (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑢) +o 𝑣))) ∘ (seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))), ∅)‘dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) = (((𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑣) +o 𝑢)) ∘ (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑢) +o 𝑣))) ∘ (seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))), ∅)‘dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))))
12 eqid 2737 . 2 (𝑏 ∈ (ω ↑o 𝐴) ↦ (((𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑣) +o 𝑢)) ∘ (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑢) +o 𝑣))) ∘ (seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))), ∅)‘dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))))) = (𝑏 ∈ (ω ↑o 𝐴) ↦ (((𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑣) +o 𝑢)) ∘ (𝑢 ∈ (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))), 𝑣 ∈ (ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))) ·o 𝑢) +o 𝑣))) ∘ (seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ ((𝑥 ∈ ((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) ↦ (dom 𝑓 +o 𝑥)) ∪ (𝑥 ∈ dom 𝑓 ↦ (((ω ↑o (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘)) ·o (((ω CNF 𝐴)‘𝑏)‘(OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘𝑘))) +o 𝑥)))), ∅)‘dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))))
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12cnfcom3clem 9617 1 (𝐴 ∈ On → ∃𝑔𝑏𝐴 (ω ⊆ 𝑏 → ∃𝑤 ∈ (On ∖ 1o)(𝑔𝑏):𝑏1-1-onto→(ω ↑o 𝑤)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wex 1781  wcel 2114  wral 3052  wrex 3062  Vcvv 3430  cdif 3887  cun 3888  wss 3890  c0 4274   cuni 4851  cmpt 5167   E cep 5523  ccnv 5623  dom cdm 5624  ccom 5628  Oncon0 6317  1-1-ontowf1o 6491  cfv 6492  (class class class)co 7360  cmpo 7362  ωcom 7810   supp csupp 8103  seqωcseqom 8379  1oc1o 8391   +o coa 8395   ·o comu 8396  o coe 8397  OrdIsocoi 9417   CNF ccnf 9573
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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-inf2 9553
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-supp 8104  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-seqom 8380  df-1o 8398  df-2o 8399  df-oadd 8402  df-omul 8403  df-oexp 8404  df-er 8636  df-map 8768  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-fsupp 9268  df-oi 9418  df-cnf 9574
This theorem is referenced by:  infxpenc2  9935
  Copyright terms: Public domain W3C validator