| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axc11rv | Structured version Visualization version GIF version | ||
| Description: Version of axc11r 2372 with a disjoint variable condition on 𝑥 and 𝑦, which is provable, on top of { ax-1 6-- ax-7 2009 }, from ax12v 2185 (contrary to axc11 2434 which seems to require the full ax-12 2184 and ax-13 2376, and to axc11r 2372 which seems to require the full ax-12 2184). (Contributed by BJ, 6-Jul-2021.) (Proof shortened by Wolf Lammen, 11-Oct-2021.) |
| Ref | Expression |
|---|---|
| axc11rv | ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axc16 2268 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 → ∀𝑥𝜑)) | |
| 2 | 1 | spsd 2194 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1539 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-12 2184 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 |
| This theorem is referenced by: dral1v 2373 bj-axc11v 37010 |
| Copyright terms: Public domain | W3C validator |