HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem reueqf 1323
Description: Equality theorem for restricted uniqueness quantifier, with bound variable hypotheses instead of distinct variable restrictions.
Hypotheses
Ref Expression
raleqf.1 (yA → ∀x yA)
raleqf.2 (yB → ∀x yB)
Assertion
Ref Expression
reueqf (A = B → (∃!xA φ ↔ ∃!xB φ))
Distinct variable group(s):   y,A   y,B   x,y

Proof of Theorem reueqf
StepHypRef Expression
1 raleqf.1 . . . 4 (yA → ∀x yA)
2 raleqf.2 . . . 4 (yB → ∀x yB)
31, 2hbeq 1171 . . 3 (A = B → ∀x A = B)
4 eleq2 1150 . . . 4 (A = B → (xAxB))
54anbi1d 469 . . 3 (A = B → ((xAφ) ↔ (xBφ)))
63, 5bieud 1012 . 2 (A = B → (∃!x(xAφ) ↔ ∃!x(xBφ)))
7 df-reu 1207 . 2 (∃!xA φ ↔ ∃!x(xAφ))
8 df-reu 1207 . 2 (∃!xB φ ↔ ∃!x(xBφ))
96, 7, 83bitr4g 428 1 (A = B → (∃!xA φ ↔ ∃!xB φ))
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127   ∧ wa 196  ∀wal 672  ∃!weu 1007   = wceq 1091   ∈ wcel 1092  ∃!wreu 1203
This theorem is referenced by:  reueq 1326
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-9 799  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-eu 1009  df-cleq 1097  df-clel 1099  df-reu 1207
metamath.org