Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equsalvw | Structured version Visualization version GIF version |
Description: Version of equsalv 2267 with a disjoint variable condition, and of equsal 2438 with two disjoint variable conditions, which requires fewer axioms. See also the dual form equsexvw 2010. (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 273 | . . 3 ⊢ ((𝑥 = 𝑦 → 𝜑) ↔ (𝑥 = 𝑦 → 𝜓)) |
3 | 2 | albii 1819 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜓)) |
4 | equsv 2008 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜓) ↔ 𝜓) | |
5 | 3, 4 | bitri 277 | 1 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1534 |
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 1969 |
This theorem depends on definitions: df-bi 209 df-ex 1780 |
This theorem is referenced by: equsexvw 2010 equvelv 2037 sb6 2092 sbievw 2102 ax13lem2 2393 reu8 3727 asymref2 5980 intirr 5981 fun11 6431 fv3 6691 fpwwe2lem12 10066 bj-dvelimdv 34179 bj-dvelimdv1 34180 wl-dfralflem 34842 undmrnresiss 39970 pm13.192 40748 |
Copyright terms: Public domain | W3C validator |