Theorem cnfcom3c 9714

Description: Wrap the construction of cnfcom3 9712 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.

Step	Hyp	Ref	Expression
1		eqid 2760	. 2 ⊢ dom (ω CNF 𝐴) = dom (ω CNF 𝐴)
2		eqid 2760	. 2 ⊢ (◡(ω CNF 𝐴)‘𝑏) = (◡(ω CNF 𝐴)‘𝑏)
3		eqid 2760	. 2 ⊢ OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅)) = OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))
4		eqid 2760	. 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 2760	. 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 2760	. 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 2760	. 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 2760	. 2 ⊢ (OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))‘∪ dom OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))) = (OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))‘∪ dom OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅)))
9		eqid 2760	. 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 2760	. 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 2760	. 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 2760	. 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 ∅)))))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cnfcom3clem 9713	1 ⊢ (𝐴 ∈ On → ∃𝑔∀𝑏 ∈ 𝐴 (ω ⊆ 𝑏 → ∃𝑤 ∈ (On ∖ 1o)(𝑔‘𝑏):𝑏–1-1-onto→(ω ↑o 𝑤)))

This proof depends on syntax axioms:   → wi 4  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3896   ∖ cdif 4044   ∪ cun 4148  ∅c0 4277  ∪ cuni 4866   ↦ cmpt 5185   E cep 5550  ^◡ccnv 5650  dom cdm 5651   ∘ ccom 5655  Oncon0 6365  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7424   ∈ cmpo 7426  ωcom 7881   supp csupp 8183  seq_ωcseqom 8464  1_oc1o 8476   +_o coa 8480   ·_o comu 8481   ↑_o coe 8482  OrdIsocoi 9510   CNF ccnf 9669

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-inf2 9649

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7882  df-1st 8005  df-2nd 8006  df-supp 8184  df-frecs 8306  df-wrecs 8337  df-recs 8386  df-rdg 8425  df-seqom 8465  df-1o 8483  df-2o 8484  df-oadd 8487  df-omul 8488  df-oexp 8489  df-er 8724  df-map 8856  df-en 8981  df-dom 8982  df-sdom 8983  df-fin 8984  df-fsupp 9361  df-oi 9511  df-cnf 9670

This theorem is used by:  infxpenc2  10108