| 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 321 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (¬ 𝜓 ↔ ¬ 𝜒)) |
| 3 | cbvraldva2.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵) | |
| 4 | 2, 3 | cbvraldva2 3341 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ¬ 𝜓 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝜒)) |
| 5 | ralnex 3091 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜓 ↔ ¬ ∃𝑥 ∈ 𝐴 𝜓) | |
| 6 | ralnex 3091 | . . 3 ⊢ (∀𝑦 ∈ 𝐵 ¬ 𝜒 ↔ ¬ ∃𝑦 ∈ 𝐵 𝜒) | |
| 7 | 4, 5, 6 | 3bitr3g 316 | . 2 ⊢ (𝜑 → (¬ ∃𝑥 ∈ 𝐴 𝜓 ↔ ¬ ∃𝑦 ∈ 𝐵 𝜒)) |
| 8 | 7 | con4bid 320 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∀wral 3079 ∃wrex 3089 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1803 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 |
| This theorem is referenced by: mreexexlemd 17690 eulerpartlemgvv 34683 onvf1odlem3 35460 cbviundavw2 36659 primrootsunit1 42726 ismnu 44835 |
| Copyright terms: Public domain | W3C validator |