Theorem 19.3v 1981

Description: Version of 19.3 2203 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 1983. (Contributed by Anthony Hart, 13-Sep-2011.) Remove dependency on ax-7 2007. (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 1980	. 2 ⊢ (∀𝑥𝜑 → 𝜑)
2		ax-5 1909	. 2 ⊢ (𝜑 → ∀𝑥𝜑)
3	1, 2	impbii 209	1 ⊢ (∀𝑥𝜑 ↔ 𝜑)

Syntax hints:   ↔ wb 206  ∀wal 1535

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967

This theorem depends on definitions:  df-bi 207  df-ex 1778

This theorem is referenced by:  19.27v  1989  19.28v  1990  19.37v  1991  axrep1  5304  axrep6  5310  kmlem14  10233  zfcndrep  10683  zfcndpow  10685  zfcndac  10688  lfuhgr3  35087  bj-snsetex  36929  iooelexlt  37328  dford4  42986  relexp0eq  43663