Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvrexdva | Structured version Visualization version GIF version |
Description: Rule used to change the bound variable in a restricted existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) |
Ref | Expression |
---|---|
cbvraldva.1 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
cbvrexdva | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐴 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvraldva.1 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) | |
2 | eqidd 2623 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐴) | |
3 | 1, 2 | cbvrexdva2 3176 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐴 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∃wrex 2913 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-cleq 2615 df-clel 2618 df-rex 2918 |
This theorem is referenced by: tfrlem3a 7473 trgcopy 25696 trgcopyeu 25698 acopyeu 25725 tgasa1 25739 2sqmo 29649 dispcmp 29926 f1omptsn 33184 |
Copyright terms: Public domain | W3C validator |