Theorem hbxfreq 2869

Description: A utility lemma to transfer a bound-variable hypothesis builder into a definition. See hbxfrbi 1827 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 2830	. 2 ⊢ (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)
3		hbxfr.2	. 2 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵)
4	2, 3	hbxfrbi 1827	1 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

Syntax hints:   → wi 4  ∀wal 1537   = wceq 1539   ∈ wcel 2106

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-cleq 2730  df-clel 2816

This theorem is referenced by:  bnj1317  32801  bnj1441  32820  bnj1441g  32821  bnj1309  33002