| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvrexdva2 | Structured version Visualization version GIF version | ||
| Description: Rule used to change the bound variable in a restricted existential quantifier with implicit substitution which also changes the quantifier domain. Deduction form. (Contributed by David Moews, 1-May-2017.) (Proof shortened by Wolf Lammen, 8-Jan-2025.) |
| Ref | Expression |
|---|---|
| cbvraldva2.1 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) |
| cbvraldva2.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| cbvrexdva2 | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐵 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvraldva2.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) | |
| 2 | 1 | notbid 320 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (¬ 𝜓 ↔ ¬ 𝜒)) |
| 3 | cbvraldva2.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵) | |
| 4 | 2, 3 | cbvraldva2 3337 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ¬ 𝜓 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝜒)) |
| 5 | ralnex 3087 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜓 ↔ ¬ ∃𝑥 ∈ 𝐴 𝜓) | |
| 6 | ralnex 3087 | . . 3 ⊢ (∀𝑦 ∈ 𝐵 ¬ 𝜒 ↔ ¬ ∃𝑦 ∈ 𝐵 𝜒) | |
| 7 | 4, 5, 6 | 3bitr3g 315 | . 2 ⊢ (𝜑 → (¬ ∃𝑥 ∈ 𝐴 𝜓 ↔ ¬ ∃𝑦 ∈ 𝐵 𝜒)) |
| 8 | 7 | con4bid 319 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∀wral 3075 ∃wrex 3085 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 |
| This theorem is referenced by: mreexexlemd 17659 eulerpartlemgvv 34634 onvf1odlem3 35412 cbviundavw2 36610 primrootsunit1 42678 ismnu 44801 |
| Copyright terms: Public domain | W3C validator |