![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > equsalvw | Structured version Visualization version GIF version |
Description: Version of equsalv 2265 with a disjoint variable condition, and of equsal 2428 with two disjoint variable conditions, which requires fewer axioms. See also the dual form equsexvw 2011. (Contributed by BJ, 31-May-2019.) |
Ref | Expression |
---|---|
equsalvw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
equsalvw | ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equsalvw.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
2 | 1 | pm5.74i 274 | . . 3 ⊢ ((𝑥 = 𝑦 → 𝜑) ↔ (𝑥 = 𝑦 → 𝜓)) |
3 | 2 | albii 1821 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜓)) |
4 | equsv 2009 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜓) ↔ 𝜓) | |
5 | 3, 4 | bitri 278 | 1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∀wal 1536 |
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 1911 ax-6 1970 |
This theorem depends on definitions: df-bi 210 df-ex 1782 |
This theorem is referenced by: equsexvw 2011 equvelv 2038 sb6 2090 sbievw 2100 ax13lem2 2383 reu8 3672 asymref2 5944 intirr 5945 fun11 6398 fv3 6663 fpwwe2lem12 10052 bj-dvelimdv 34290 bj-dvelimdv1 34291 wl-dfralflem 35003 undmrnresiss 40304 pm13.192 41114 |
Copyright terms: Public domain | W3C validator |