Theorem 19.3v 2015

Description: Version of 19.3 2241 with a disjoint variable condition, requiring fewer axioms. Any formula can be universally quantified using a variable which it does not contain. See also 19.9v 2017. (Contributed by Anthony Hart, 13-Sep-2011.) Remove dependency on ax-7 2041. (Revised by Wolf Lammen, 4-Dec-2017.) (Proof shortened by Wolf Lammen, 20-Oct-2023.)

Assertion

Ref	Expression
19.3v	⊢ (∀𝑥𝜑 ↔ 𝜑)

Distinct variable group:   𝜑,𝑥

Proof of Theorem 19.3v

Step	Hyp	Ref	Expression
1		spvw 2014	. 2 ⊢ (∀𝑥𝜑 → 𝜑)
2		ax-5 1943	. 2 ⊢ (𝜑 → ∀𝑥𝜑)
3	1, 2	impbii 212	1 ⊢ (∀𝑥𝜑 ↔ 𝜑)

This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1568

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

This proof depends on definitions:  df-bi 210  df-ex 1813

This theorem is used by:  19.27v  2028  19.28v  2029  19.37v  2030  axrep1  5244  axrep4v  5248  axrep6OLD  5253  kmlem14  10166  zfcndrep  10617  zfcndpow  10619  zfcndac  10622  lfuhgr3  35633  bj-snsetex  37640  iooelexlt  38049  dford4  43797  relexp0eq  44468