| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sb3b | Structured version Visualization version GIF version | ||
| Description: Simplified definition of substitution when variables are distinct. This is the biconditional strengthening of sb3 2509. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by BJ, 6-Oct-2018.) Shorten sb3 2509. (Revised by Wolf Lammen, 21-Feb-2021.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sb3b | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb4b 2507 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 2 | equs5 2492 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 3 | 1, 2 | bitr4d 285 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1568 ∃wex 1809 [wsb 2096 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-10 2176 ax-12 2213 ax-13 2404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1810 df-nf 1814 df-sb 2097 |
| This theorem is referenced by: sb3 2509 sb1 2510 |
| Copyright terms: Public domain | W3C validator |