For instance, we want to prove that $\mathsf{ZFC} \vdash \forall x[x \in \mathrm{OD} \implies \phi(x)]$ for some formula $\phi(x)$ of the language of set theory ($\mathrm{OD}$ is the class of ordinal definable sets.) $\mathrm{OD}$ has two definitions which can be proved equivalent, the metalanguage version which quantifies the formulas directly, and the internalized version(Actually I'm not sure that this is right.) I am interested in using the former version to prove the theorem. Let $M$ be an arbitrary model of $\mathsf{ZFC}$. It suffices to prove that $\forall x \in M[M \vDash x \in \mathrm{OD} \implies M \vDash \phi(x)]$. We invoke here the equivalent metalanguage definition to get a formula $\psi$ and ordinals $\alpha_1, \ldots, \alpha_n \in M$ such that $$M \vDash \forall y[y \in x \iff \psi(y, \alpha_1, \ldots, \alpha_n)]$$ holds, and then prove $M \vDash \phi(x)$ with it. Is this a valid way to prove theorems?
2026-04-06 04:35:59.1775450159
Is "going through the metalanguage" while proving a theorem allowed?
134 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Related Questions in FIRST-ORDER-LOGIC
- Proving the schema of separation from replacement
- Find the truth value of... empty set?
- Exchanging RAA with double negation: is this valid?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Primitive recursive functions of bounded sum
- Show formula which does not have quantifier elimination in theory of infinite equivalence relations.
- Logical Connectives and Quantifiers
- Is this proof correct? (Proof Theory)
- Is there only a finite number of non-equivalent formulas in the predicate logic?
- How to build a list of all the wfs (well-formed sentences)?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Yes this is allright. Showing $\mathrm{ZFC}\vdash\forall x[x\in\mathrm{OD}\Rightarrow\phi(x)]$ is by Gödels completeness theorem equivalent to showing that the formula $\forall x[x\in\mathrm{OD}\Rightarrow\phi(x)]$ is true in any model $M$ of $\mathrm{ZFC}$. Now as you mention, if one picks an arbitrary such $M$, this amounts to showing $M\models\phi(x)$ for all $x\in\mathrm{OD}^M$. By definition of $\mathrm {OD}$, we have $$M\models \exists\theta\in\mathrm{Fml}\exists\alpha<\beta\forall y [y\in x\Leftrightarrow \mathrm{Sat}(V_\beta, \theta, y, \alpha)]$$
(note that one $\alpha$ is enough since $M$-finitely many ordinals can be coded into one) for such $x$. Now we can pick witnesses $\theta, \alpha, \beta$ for this statement (note that $\theta$ is essentially an $M$-integer, thus $M$-ordinal). This yields a real formula $\psi$ so that $$M\models\forall y\ y\in x\Leftrightarrow\psi(y, \theta,\beta,\alpha)$$ Now $x$ fits the bill for the kind of sets $z$ for which you have shown $M\models\phi(z)$ and thus $M\models\phi(x)$ as desired.