![]() |
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 2476. Usage of this theorem is discouraged because it depends on ax-13 2371. (Contributed by BJ, 6-Oct-2018.) Shorten sb3 2476. (Revised by Wolf Lammen, 21-Feb-2021.) (New usage is discouraged.) |
Ref | Expression |
---|---|
sb3b | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb4b 2474 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
2 | equs5 2459 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
3 | 1, 2 | bitr4d 281 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∀wal 1539 ∃wex 1781 [wsb 2067 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-10 2137 ax-12 2171 ax-13 2371 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-ex 1782 df-nf 1786 df-sb 2068 |
This theorem is referenced by: sb3 2476 sb1 2477 |
Copyright terms: Public domain | W3C validator |