|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > equsalh | Structured version Visualization version GIF version | ||
| Description: An equivalence related to implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2376. See equsalhw 2290 for a version with a disjoint variable condition requiring fewer axioms. (Contributed by NM, 2-Jun-1993.) (New usage is discouraged.) | 
| Ref | Expression | 
|---|---|
| equsalh.1 | ⊢ (𝜓 → ∀𝑥𝜓) | 
| equsalh.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | 
| Ref | Expression | 
|---|---|
| equsalh | ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | equsalh.1 | . . 3 ⊢ (𝜓 → ∀𝑥𝜓) | |
| 2 | 1 | nf5i 2145 | . 2 ⊢ Ⅎ𝑥𝜓 | 
| 3 | equsalh.2 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 4 | 2, 3 | equsal 2421 | 1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1537 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-10 2140 ax-12 2176 ax-13 2376 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1779 df-nf 1783 | 
| This theorem is referenced by: dvelimf-o 38931 | 
| Copyright terms: Public domain | W3C validator |