@audvin@dannyconversano@haider1 Newtonian mechanics, special and general relativity and quantum mechanics (these four are basically the entire scope of progress in physics in the last 400 years) were created without any engineering feedback.
@LongFormMath The condition that p_n is prime is never used after the first inequality, so the theorem holds for any sequence satisfying that inequality.
@PulkkinenEsa@MaszynaTrurla@Anthony_Bonato But here the sequence of definitions does make sense from a categorical point of view: a groupoid is a category where each morphism is isomorphism, and a group is a groupoid with one object.
@PhilosopherJoeC@DrJavierDeLaHe1 PA defines arithmetical terms and formulae. "True" means provable. 1+1=2 is provable. Truth of a Godel statement is also proved (specifically, in the Godels's paper).
@JDHamkins position. After this substitution, the string looks like PrrrX, where P is never modified. So by the lemma, Prr will be never modified after that point. Now we have a shorter string rX with an infinite history.
@JDHamkins this substitution the string looks like PrruuuY, so by the inductive assumption, Prruu and hence Prr will never be changed. QED. Now for an arbitrary infinite history, take the leftmost ever substituted triple, say PludX. Then find the earliest substitution in this [position]
@JDHamkins Isn't ZF hierarchy not really a hierarchy, because a level in it can contain sets definable only through comprehension of a formula with parameters from higher levels? That is, it's impredicative?