Theorem cnfcom3c 9682

Description: Wrap the construction of cnfcom3 9680 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 2765	. 2 ⊢ dom (ω CNF 𝐴) = dom (ω CNF 𝐴)
2		eqid 2765	. 2 ⊢ (◡(ω CNF 𝐴)‘𝑏) = (◡(ω CNF 𝐴)‘𝑏)
3		eqid 2765	. 2 ⊢ OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅)) = OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))
4		eqid 2765	. 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 2765	. 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 2765	. 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 2765	. 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 2765	. 2 ⊢ (OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))‘∪ dom OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))) = (OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅))‘∪ dom OrdIso( E , ((◡(ω CNF 𝐴)‘𝑏) supp ∅)))
9		eqid 2765	. 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 2765	. 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 2765	. 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 2765	. 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 9681	1 ⊢ (𝐴 ∈ On → ∃𝑔∀𝑏 ∈ 𝐴 (ω ⊆ 𝑏 → ∃𝑤 ∈ (On ∖ 1o)(𝑔‘𝑏):𝑏–1-1-onto→(ω ↑o 𝑤)))

This proof depends on syntax axioms:   → wi 4  ∃wex 1812   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091  Vcvv 3457   ∖ cdif 3903   ∪ cun 3904   ⊆ wss 3906  ∅c0 4286  ∪ cuni 4874   ↦ cmpt 5194   E cep 5562  ^◡ccnv 5662  dom cdm 5663   ∘ ccom 5667  Oncon0 6364  –1-1-onto→wf1o 6539  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421  ωcom 7868   supp csupp 8162  seq_ωcseqom 8440  1_oc1o 8452   +_o coa 8456   ·_o comu 8457   ↑_o coe 8458  OrdIsocoi 9478   CNF ccnf 9637

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-inf2 9617

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-supp 8163  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-seqom 8441  df-1o 8459  df-2o 8460  df-oadd 8463  df-omul 8464  df-oexp 8465  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-fsupp 9329  df-oi 9479  df-cnf 9638

This theorem is used by:  infxpenc2  10022