Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axc11v | Structured version Visualization version GIF version |
Description: Version of axc11 2448 with a disjoint variable condition on 𝑥 and 𝑦, which is provable, on top of { ax-1 6-- ax-7 2011 }, from ax12v 2174 (contrary to axc11 2448 which seems to require the full ax-12 2173 and ax-13 2386). (Contributed by NM, 16-May-2008.) (Revised by BJ, 6-Jul-2021.) (Proof shortened by Wolf Lammen, 11-Oct-2021.) |
Ref | Expression |
---|---|
axc11v | ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 → ∀𝑦𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | axc16g 2257 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 → ∀𝑦𝜑)) | |
2 | 1 | spsd 2182 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 → ∀𝑦𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-12 2173 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 |
This theorem is referenced by: dral1v 2383 |
Copyright terms: Public domain | W3C validator |