Theorem r19.3rm 3539

Description: Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 19-Dec-2018.)

Hypothesis

Ref	Expression
r19.3rm.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
r19.3rm	⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem r19.3rm

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2259	. . 3 ⊢ (𝑎 = 𝑦 → (𝑎 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2	1	cbvexv 1933	. 2 ⊢ (∃𝑎 𝑎 ∈ 𝐴 ↔ ∃𝑦 𝑦 ∈ 𝐴)
3		eleq1 2259	. . . 4 ⊢ (𝑎 = 𝑥 → (𝑎 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
4	3	cbvexv 1933	. . 3 ⊢ (∃𝑎 𝑎 ∈ 𝐴 ↔ ∃𝑥 𝑥 ∈ 𝐴)
5		biimt 241	. . . 4 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 → 𝜑)))
6		df-ral 2480	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
7		r19.3rm.1	. . . . . 6 ⊢ Ⅎ𝑥𝜑
8	7	19.23 1692	. . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ (∃𝑥 𝑥 ∈ 𝐴 → 𝜑))
9	6, 8	bitri 184	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 → 𝜑))
10	5, 9	bitr4di 198	. . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
11	4, 10	sylbi 121	. 2 ⊢ (∃𝑎 𝑎 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
12	2, 11	sylbir 135	1 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))

Syntax hints:   → wi 4   ↔ wb 105  ∀wal 1362  Ⅎwnf 1474  ∃wex 1506   ∈ wcel 2167  ∀wral 2475

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-nf 1475  df-cleq 2189  df-clel 2192  df-ral 2480

This theorem is referenced by:  r19.28m  3540  r19.3rmv  3541  r19.27m  3546  indstr  9667