Theorem rzalf 45329

Description: A version of rzal 4448 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypothesis

Ref	Expression
rzalf.1	⊢ Ⅎ𝑥 𝐴 = ∅

Assertion

Ref	Expression
rzalf	⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)

Proof of Theorem rzalf

Step	Hyp	Ref	Expression
1		rzalf.1	. 2 ⊢ Ⅎ𝑥 𝐴 = ∅
2		ne0i 4294	. . . 4 ⊢ (𝑥 ∈ 𝐴 → 𝐴 ≠ ∅)
3	2	necon2bi 2963	. . 3 ⊢ (𝐴 = ∅ → ¬ 𝑥 ∈ 𝐴)
4	3	pm2.21d 121	. 2 ⊢ (𝐴 = ∅ → (𝑥 ∈ 𝐴 → 𝜑))
5	1, 4	ralrimi 3235	1 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)

Syntax hints:   → wi 4   = wceq 1542  Ⅎwnf 1785   ∈ wcel 2114  ∀wral 3052  ∅c0 4286

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-dif 3905  df-nul 4287

This theorem is referenced by:  stoweidlem18  46329  stoweidlem28  46339  stoweidlem55  46366