Theorem cnfcom3c 9685

Description: Wrap the construction of cnfcom3 9683 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 9684	1 ⊢ (𝐴 ∈ On → ∃𝑔∀𝑏 ∈ 𝐴 (ω ⊆ 𝑏 → ∃𝑤 ∈ (On ∖ 1o)(𝑔‘𝑏):𝑏–1-1-onto→(ω ↑o 𝑤)))

This proof depends on syntax axioms:   → wi 4  ∃wex 1812   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∖ cdif 3896   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  ∪ cuni 4867   ↦ cmpt 5186   E cep 5554  ^◡ccnv 5654  dom cdm 5655   ∘ ccom 5659  Oncon0 6357  –1-1-onto→wf1o 6532  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  ωcom 7862   supp csupp 8158  seq_ωcseqom 8436  1_oc1o 8448   +_o coa 8452   ·_o comu 8453   ↑_o coe 8454  OrdIsocoi 9481   CNF ccnf 9640

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-inf2 9620

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 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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  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 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-supp 8159  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-seqom 8437  df-1o 8455  df-2o 8456  df-oadd 8459  df-omul 8460  df-oexp 8461  df-er 8696  df-map 8828  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-fsupp 9332  df-oi 9482  df-cnf 9641

This theorem is used by:  infxpenc2  10025