New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > eubidv | GIF version |
Description: Formula-building rule for uniqueness quantifier (deduction rule). (Contributed by NM, 9-Jul-1994.) |
Ref | Expression |
---|---|
eubidv.1 | ⊢ (φ → (ψ ↔ χ)) |
Ref | Expression |
---|---|
eubidv | ⊢ (φ → (∃!xψ ↔ ∃!xχ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1619 | . 2 ⊢ Ⅎxφ | |
2 | eubidv.1 | . 2 ⊢ (φ → (ψ ↔ χ)) | |
3 | 1, 2 | eubid 2211 | 1 ⊢ (φ → (∃!xψ ↔ ∃!xχ)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 176 ∃!weu 2204 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-11 1746 |
This theorem depends on definitions: df-bi 177 df-ex 1542 df-nf 1545 df-eu 2208 |
This theorem is referenced by: eubii 2213 eueq2 3011 eueq3 3012 moeq3 3014 fneu 5188 feu 5243 dff4 5422 scancan 6332 |
Copyright terms: Public domain | W3C validator |