![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cbvrexdvaOLD | Structured version Visualization version GIF version |
Description: Obsolete version of cbvrexdva 3246 as of 9-Mar-2025. (Contributed by David Moews, 1-May-2017.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cbvrexdva.1 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
cbvrexdvaOLD | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐴 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvrexdva.1 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) | |
2 | eqidd 2741 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐴) | |
3 | 1, 2 | cbvrexdva2 3357 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐴 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∃wrex 3076 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1778 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |