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

Theorem cnfcom3c 9671
Description: Wrap the construction of cnfcom3 9669 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 2769 . 2 dom (ω CNF 𝐴) = dom (ω CNF 𝐴)
2 eqid 2769 . 2 ((ω CNF 𝐴)‘𝑏) = ((ω CNF 𝐴)‘𝑏)
3 eqid 2769 . 2 OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)) = OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))
4 eqid 2769 . 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 2769 . 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 2769 . 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 2769 . 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 2769 . 2 (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))) = (OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅))‘ dom OrdIso( E , (((ω CNF 𝐴)‘𝑏) supp ∅)))
9 eqid 2769 . 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 2769 . 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 2769 . 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 2769 . 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 9670 1 (𝐴 ∈ On → ∃𝑔𝑏𝐴 (ω ⊆ 𝑏 → ∃𝑤 ∈ (On ∖ 1o)(𝑔𝑏):𝑏1-1-onto→(ω ↑o 𝑤)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wex 1806  wcel 2149  wral 3085  wrex 3095  Vcvv 3463  cdif 3910  cun 3911  wss 3913  c0 4294   cuni 4873  cmpt 5193   E cep 5558  ccnv 5658  dom cdm 5659  ccom 5663  Oncon0 6357  1-1-ontowf1o 6532  cfv 6533  (class class class)co 7408  cmpo 7410  ωcom 7858   supp csupp 8152  seqωcseqom 8430  1oc1o 8442   +o coa 8446   ·o comu 8447  o coe 8448  OrdIsocoi 9467   CNF ccnf 9626
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 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-inf2 9606
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  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-rmo 3376  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-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-supp 8153  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-seqom 8431  df-1o 8449  df-2o 8450  df-oadd 8453  df-omul 8454  df-oexp 8455  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-fsupp 9318  df-oi 9468  df-cnf 9627
This theorem is referenced by:  infxpenc2  10002
  Copyright terms: Public domain W3C validator