| 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 2507. Usage of this theorem is discouraged because it depends on ax-13 2402. (Contributed by BJ, 6-Oct-2018.) Shorten sb3 2507. (Revised by Wolf Lammen, 21-Feb-2021.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sb3b | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb4b 2505 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 2 | equs5 2490 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 3 | 1, 2 | bitr4d 284 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∀wal 1557 ∃wex 1798 [wsb 2089 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-10 2174 ax-12 2211 ax-13 2402 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ex 1799 df-nf 1803 df-sb 2090 |
| This theorem is referenced by: sb3 2507 sb1 2508 |
| Copyright terms: Public domain | W3C validator |