Theorem 19.21v

Description: Version of 19.21 with a disjoint variable condition, requiring fewer axioms.

Notational convention: We sometimes suffix with "v" the label of a theorem using a distinct variable ("dv") condition instead of a nonfreeness hypothesis such as F/ x ph . Conversely, we sometimes suffix with "f" the label of a theorem introducing such a nonfreeness hypothesis ("f" stands for "not free in", see df-nf ) instead of a disjoint variable condition. For instance, 19.21v versus 19.21 and vtoclf versus vtocl . Note that "not free in" is less restrictive than "does not occur in". Note that the version with a disjoint variable condition is easily proved from the version with the corresponding nonfreeness hypothesis, by using nfv . However, the dv version can often be proved from fewer axioms. (Contributed by NM, 21-Jun-1993) Reduce dependencies on axioms. (Revised by Wolf Lammen, 2-Jan-2020) (Proof shortened by Wolf Lammen, 12-Jul-2020)

	Ref	Expression
Assertion	19.21v	⊢ ( ∀ 𝑥 ( 𝜑 → 𝜓 ) ↔ ( 𝜑 → ∀ 𝑥 𝜓 ) )

Proof

Step	Hyp	Ref	Expression
1		stdpc5v	⊢ ( ∀ 𝑥 ( 𝜑 → 𝜓 ) → ( 𝜑 → ∀ 𝑥 𝜓 ) )
2		ax5e	⊢ ( ∃ 𝑥 𝜑 → 𝜑 )
3	2	imim1i	⊢ ( ( 𝜑 → ∀ 𝑥 𝜓 ) → ( ∃ 𝑥 𝜑 → ∀ 𝑥 𝜓 ) )
4		19.38	⊢ ( ( ∃ 𝑥 𝜑 → ∀ 𝑥 𝜓 ) → ∀ 𝑥 ( 𝜑 → 𝜓 ) )
5	3 4	syl	⊢ ( ( 𝜑 → ∀ 𝑥 𝜓 ) → ∀ 𝑥 ( 𝜑 → 𝜓 ) )
6	1 5	impbii	⊢ ( ∀ 𝑥 ( 𝜑 → 𝜓 ) ↔ ( 𝜑 → ∀ 𝑥 𝜓 ) )