| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sb9i | Structured version Visualization version GIF version | ||
| Description: Commutation of quantification and substitution variables. Usage of this theorem is discouraged because it depends on ax-13 2371. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 15-Jun-2019.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sb9i | ⊢ (∀𝑥[𝑥 / 𝑦]𝜑 → ∀𝑦[𝑦 / 𝑥]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb9 2518 | . 2 ⊢ (∀𝑥[𝑥 / 𝑦]𝜑 ↔ ∀𝑦[𝑦 / 𝑥]𝜑) | |
| 2 | 1 | biimpi 216 | 1 ⊢ (∀𝑥[𝑥 / 𝑦]𝜑 → ∀𝑦[𝑦 / 𝑥]𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1538 [wsb 2065 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-10 2142 ax-11 2158 ax-12 2178 ax-13 2371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-nf 1784 df-sb 2066 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |