Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvrmov | Structured version Visualization version GIF version |
Description: Change the bound variable of a restricted at-most-one quantifier using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2389. (Contributed by Alexander van der Vekens, 17-Jun-2017.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cbvralv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvrmov | ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1914 | . 2 ⊢ Ⅎ𝑦𝜑 | |
2 | nfv 1914 | . 2 ⊢ Ⅎ𝑥𝜓 | |
3 | cbvralv.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
4 | 1, 2, 3 | cbvrmo 3445 | 1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑦 ∈ 𝐴 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∃*wrmo 3140 |
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 ax-7 2014 ax-8 2115 ax-10 2144 ax-11 2160 ax-12 2176 ax-13 2389 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clel 2892 df-nfc 2962 df-ral 3142 df-rex 3143 df-reu 3144 df-rmo 3145 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |