![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cbvrex | Structured version Visualization version GIF version |
Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2367. Use the weaker cbvrexw 3301 when possible. (Contributed by NM, 31-Jul-2003.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cbvral.1 | ⊢ Ⅎ𝑦𝜑 |
cbvral.2 | ⊢ Ⅎ𝑥𝜓 |
cbvral.3 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvrex | ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2899 | . 2 ⊢ Ⅎ𝑥𝐴 | |
2 | nfcv 2899 | . 2 ⊢ Ⅎ𝑦𝐴 | |
3 | cbvral.1 | . 2 ⊢ Ⅎ𝑦𝜑 | |
4 | cbvral.2 | . 2 ⊢ Ⅎ𝑥𝜓 | |
5 | cbvral.3 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
6 | 1, 2, 3, 4, 5 | cbvrexf 3354 | 1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 Ⅎwnf 1778 ∃wrex 3067 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-10 2130 ax-11 2147 ax-12 2167 ax-13 2367 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-tru 1537 df-ex 1775 df-nf 1779 df-sb 2061 df-clel 2806 df-nfc 2881 df-ral 3059 df-rex 3068 |
This theorem is referenced by: cbvrexv 3358 cbvrexsv 3360 cbvrmo 3422 cbviung 5041 |
Copyright terms: Public domain | W3C validator |