Theorem raleqbi1dv 2507

Description: Equality deduction for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)

Hypothesis

Ref	Expression
raleqd.1	⊢ (A = B → (φ ↔ ψ))

Assertion

Ref	Expression
raleqbi1dv	⊢ (A = B → (∀x ∈ A φ ↔ ∀x ∈ B ψ))

Distinct variable groups:   x,A   x,B

Allowed substitution hints:   φ(x)   ψ(x)

Proof of Theorem raleqbi1dv

Step	Hyp	Ref	Expression
1		raleq 2499	. 2 ⊢ (A = B → (∀x ∈ A φ ↔ ∀x ∈ B φ))
2		raleqd.1	. . 3 ⊢ (A = B → (φ ↔ ψ))
3	2	ralbidv 2320	. 2 ⊢ (A = B → (∀x ∈ B φ ↔ ∀x ∈ B ψ))
4	1, 3	bitrd 177	1 ⊢ (A = B → (∀x ∈ A φ ↔ ∀x ∈ B ψ))

Syntax hints:   → wi 4   ↔ wb 98   = wceq 1242  ∀wral 2300

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019

This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ral 2305

This theorem is referenced by:  peano5  4264  isoeq4  5387  pitonn  6724  peano5nni  7678  1nn  7686  peano2nn  7687  dfuzi  8104  bj-indeq  9364  peano5set  9374  bj-nntrans  9385