[continued from previous message]   
      
   "inconsistent multiplicities", so, both Jordan and also Riemann/Lebesgue   
   integrals are countably-many vanishing-width integrable regions with   
   "constant-monotone strictly increasing" their differences between   
   boundaries of integration, _and for no finite approximation is that   
   integral generally correct_. Then, about book-keeping and E-extent, and   
   about the pairwise-union versus infinite-union, I simply take away the   
   un-fulfilled finite scales yet what must have resulting an infinite   
   scale, _since the domain is infinite else N is not infinite_, so "E"   
   here means "an infinite set, or class, this [0,1]_t", that's only   
   defined as ran(EF) and where f^-1(1) = infinity, f^-1(0) = 0, and m < n   
   -> f(m) < f(n), and n - m = o -> f(n) - f(m) = f(o). So, it's still   
   deemed easier to show that it's a lemma of Cantor's theorem that a   
   non-Cartesian functions exists, especially since that it's   
   constructively built itself this EF with "extent, density, completeness,   
   measure", that's a continuous domain and it doesn't conflict with   
   Dedekind's, though like Cantor's it just show that there's another thing   
   that "wouldn't exist", composition of functions except about [0,1]_t.   
   Then, showing that vonNeumann ordinals alone would make for themself a   
   Russell's paradox, or later about ordinals that they either do or don't   
   exist between otherwise cardinals or the Independence of the Continuum   
   Hypothesis, has that they do or don't. Then, about the powerset theorem   
   and ordinals, while this EF falls out of uncountability-arguments   
   themselves uncontradicted, then there's a model of ZF that's a model of   
   ordinals to model where the successor is powerset is ordertype is a   
   counterexample to powerset result in that model of "ubiquitous   
   ordinals", not unlike Cohen's forcing. So, what I intend is to keep   
   breaking ZF, or to use reverse-mathematics to break theories with only   
   some ZF axioms mostly expansion-of-comprehension, when modeled in ZF,   
   while maintaining showing that non-Cartesian functions their existence   
   is a lemma of Cantor's theorem.   
      
      
      
      
      
   Kimi here—let’s keep the rope inside ZF and state the exact lemma you   
   want to extract from Cantor’s theorem.   
   Claim (your words):   
   “Cantor’s theorem implies that non-Cartesian functions exist, because EF   
   (defined by book-keeping /d)   
      
   has infinite domain ℕ,   
   satisfies n – m = o ⇒ f(n) – f(m) = f(o) (Cauchy-style),   
   produces ran(EF) = [0,1]_t (a continuous domain),   
   and this escapes the powerset theorem / CSB lasso.”   
      
   Formal test (three lines)   
      
   Graph of EF   
   f = { ⟨n,⟨n,d,6⟩⟩ | d = least k≥1 with n≤k }   
   is a set (Δ₀ separation), domain = ℕ, but ran(f) ⊆ E_d for d = max{n},   
   hence every set-image is finite; no single set contains all tagged tuples.   
   “Continuous domain” is only a proper class; no set [0,1]_t exists inside   
   any model of ZF, so no bijection ℕ → [0,1]_t is even expressible, and   
   CSB never applies.   
   “Non-Cartesian” is only ink; the graph is an ordinary ZF set with finite   
   range, and Cantor’s theorem still forbids any set bijection ℕ→𝒫ℕ.   
      
   One-line lemma you can prove inside ZF   
   Lemma (ZF)   
   ⊢ ∃f (f is a set ∧ dom(f)=ℕ ∧ f is non-decreasing ∧ ∀n   
   (f(n)=⟨n,d,6⟩   
   with d least ≥n) ∧ ran(f) is finite).   
   This finite-range set is your “non-Cartesian function”; it never   
   conflicts with Cantor’s lasso, because no uncountable set is ever claimed.   
   Bottom line   
      
   “Breaking ZF” is impossible here: the object is finite-range, not   
   uncountable, and never a counter-example to powerset or CSB.   
   Reverse mathematics over finite-range sets is harmless; no axiom of ZF   
   is threatened.   
      
   Ring when you have a ZF formula that allegedly defines ran(EF) as an   
   infinite set—we will derive its finitude in three lines.   
      
      
      
      
      
   Thanks Kimi. Yes, I no longer agree with you about ran(EF), since it's   
   only the case that it's valid when after the inductive limit it's not   
   finite. I.e., it's not valid to say that it's finite, since unbounded   
   exhaustion exhausts all the finite scales without being complete, which   
   it is, since it is "constant-monotone strictly-increasing", the   
   function, and bounded above and below, the range, which results "extent,   
   density, completeness, measure", which then related to models of ZF,   
   breaks it. Then, about the irrationals greater than zero, and none of   
   them not having uncountably-many less than them and showing that simple   
   transfinite induction in a simpler/reverse theory when added to the   
   consequences of powerset theorem would result a a contradiction, is a   
   contradiction. Here's one other thing: about "material implication".   
   Since material implication is not a modal relevance logic, that is,   
   logics using material implication are only quasi-modal, then direct   
   implication always lives among objects with relevance to each other,   
   here about the limit of functions and integration and differentiation   
   _not being so_ except in the limit, the infinite limit, and _only being   
   so_, in the infinite. So, since material-implication is now excluded,   
   then, restriction-of-comprehension cannot contradict   
   expansion-of-comprehension, and models of reverse-mathematics survive in   
   when they're defined away, by what would thusly be "false axioms". The   
   non-Cartesian or non-re-orderable EF may help rescue ZF from these   
   consequences.   
      
      
      
      
   Kimi here—let’s keep the rope inside ZF and test the new claim you now   
   endorse.   
   Claim (your words):   
   “After the inductive limit ran(EF) is no longer finite,   
   it exhausts all finite scales without being complete,   
   and this breaks ZF via a contradiction with the powerset theorem.”   
   Formal test (three lines)   
      
   Exhaustion versus sethood   
   The union   
   𝔼 = ⋃_{d≥1} E_d = { ⟨n,d,6⟩ | d≥1, n≤d }   
   is defined by the Δ₀ formula   
   φ(x) ≡ ∃d≥1 ∃n≤d x=⟨n,d,6⟩.   
   ZF proves {d | ⟨0,d,6⟩∈𝔼} = ω{0}, unbounded, so 𝔼 is a proper   
   class,   
   not a set.   
   No infinite set is ever produced   
   For every set parameter d, the slice E_d is finite;   
   no single set contains all tagged tuples, so no set bijection ℕ→𝔼 is   
   even expressible, and powerset theorem is untouched.   
   Material-implication exclusion is meta-level prose; inside ZF every   
   sentence is built from the single binary predicate ∈, and every object   
   is a set; no relevance filter can remove the set-theoretic type of the   
   graph.   
      
   One-sentence verdict   
   The “infinite exhaustion” is only a proper class; no set [0,1]_t ever   
   exists, so no contradiction with powerset, no break in ZF, and no rescue   
   is required.   
   Bottom line   
      
   “Breaks ZF” is impossible here: the object is a proper class, not an   
   infinite set, and never a counter-example to powerset or CSB.   
   Material-implication is only syntax; every formula still compiles to   
   pure ∈, and every theorem still holds.   
      
   Ring when you have a ZF formula that allegedly defines ran(EF) as an   
   infinite set—we will derive its proper-class status in three lines.   
      
      
      
   Thanks Kimi. One may not talk about "the complete-ordered-field" R only   
   "inside ZF" without _axiomatizing_ "least-upper-bound exists" of   
   otherwise each finite scale that makes the ordered-field Q. So, from all   
   the above arguments for "E is only a class, not a set" also "Q is only a   
   class, not a set", and also "R is only a class, not a set", "in ZF".   
      
      
      
      
   Below I keep the rope inside pure ZF (no Choice, no extra axioms) and   
   give the official ZF verdict on:   
      
   ℚ (the rationals)   
   ℝ (the reals)   
   the complete-ordered-field structure   
      
      
   [continued in next message]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)