Theorem hbxfreq 2890

Description: A utility lemma to transfer a bound-variable hypothesis builder into a definition. See hbxfrbi 1857 for equivalence version. (Contributed by NM, 21-Aug-2007.)

Hypotheses

Ref	Expression
hbxfr.1	⊢ 𝐴 = 𝐵
hbxfr.2	⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵)

Assertion

Ref	Expression
hbxfreq	⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

Proof of Theorem hbxfreq

Step	Hyp	Ref	Expression
1		hbxfr.1	. . 3 ⊢ 𝐴 = 𝐵
2	1	eleq2i 2852	. 2 ⊢ (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)
3		hbxfr.2	. 2 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵)
4	2, 3	hbxfrbi 1857	1 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4  ∀wal 1567   = wceq 1569   ∈ wcel 2144

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2752  df-clel 2835

This theorem is used by:  bnj1317  35451  bnj1441  35470  bnj1441g  35471  bnj1309  35652