If I use an axiom to prove a theorem, i.e. use the axioms of equality in FOL to prove the converse of the axiom of extensionality, do I list those axioms as premises in a formal proof?
The answer seems obvious already but doing that means that the theorem I'm actually proving is $$\text{axioms of equality in FOL}\vdash\text{converse of axiom of extensionality}$$ and not the latter independently. Is there a rule that allows me to independently write down the statement that follows after $\vdash$ when I know that the statement preceding it is true?
2026-03-25 10:55:31.1774436131
Can axioms be premises in formal proofs?
217 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in NATURAL-DEDUCTION
- Predicate logic: Natural deduction: Introducing universal quantifier
- Deduce formula from set of formulas
- Prove the undecidability of a formula
- Natural deduction proof for $(P\to\lnot Q)\to(\lnot P \lor\lnot Q)$
- How do I build a proof in natural deduction?
- Deductive Logic Proof
- Can the natural deduction system prove $P \iff ¬P$ to show that it's a contradiction?
- Exercises and solutions for natural deduction proofs in Robinson and Peano arithmetic
- How would I show that X is equivalent to ((¬X ↔ X ) ∨ X )?
- Equivalence proof by using identities and ‘n series of substitutions: (P ⋁ Q) → (P ⋀ Q) ≡ (P → Q) ⋀ (Q → P).
Related Questions in FORMAL-PROOFS
- What is a gross-looking formal axiomatic proof for a relatively simple proposition?
- Limit of $f(x) = x \bmod k$
- Need help with formalising proofs in Calculus. Convergent and Divergent series:
- Proving either or statements (in group theory)
- Prove a floor function is onto/surjective
- Countability of Fibonacci series
- Can the natural deduction system prove $P \iff ¬P$ to show that it's a contradiction?
- How would I show that X is equivalent to ((¬X ↔ X ) ∨ X )?
- Variations in the Statement of Strong Induction: Equivalent or Different?
- Is this proof correct? (natural deduction)
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?
The symbol $\vdash$ is not really what you want. You are doing metalogic, so to speak, and the first rule is not to mess up with notation and conflate lower order logic with higher order logic. Something like $\Rightarrow$ is more suitable.
Furthermore, you cannot do metalogic over FOL as you were actually doing FOL. You are quantifying over sets, sets of sets, etc. You are outside FOL.
Those axioms define the symbol $=$ in a higher order metalogic, and the symbol is employed as a primitive term (what means it cannot be "proved"). You should think of axioms as definitions of its terms and the related concepts appearing in the axiom. I highly recommend you read Tarski to have a superb and clear overview of all of these issues.
Thus, proving one axiom from the other might be useful, although it is perhaps not what you think you are doing. If you strip the axiom of extensionality out of the equality symbol/concept, you still do set theory. If you want to do FOL with equality, then you introduce the equality symbol in the axiom of equality.
Anyway, Equality in mathematics comes with plenty of different flavors. Philosophically speaking, there seems to be nothing better than Leibniz's definition.