| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvraldva2 | Structured version Visualization version GIF version | ||
| Description: Rule used to change the bound variable in a restricted universal quantifier with implicit substitution which also changes the quantifier domain. Deduction form. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| cbvraldva2.1 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) |
| cbvraldva2.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| cbvraldva2 | ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝑥 = 𝑦) | |
| 2 | cbvraldva2.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵) | |
| 3 | 1, 2 | eleq12d 2835 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
| 4 | cbvraldva2.1 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) | |
| 5 | 3, 4 | imbi12d 346 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑥 ∈ 𝐴 → 𝜓) ↔ (𝑦 ∈ 𝐵 → 𝜒))) |
| 6 | 5 | cbvaldvaw 2046 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜓) ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜒))) |
| 7 | df-ral 3056 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) | |
| 8 | df-ral 3056 | . 2 ⊢ (∀𝑦 ∈ 𝐵 𝜒 ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜒)) | |
| 9 | 6, 7, 8 | 3bitr4g 316 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∀wal 1546 = wceq 1548 ∈ wcel 2121 ∀wral 3055 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-ex 1788 df-cleq 2733 df-clel 2816 df-ral 3056 |
| This theorem is referenced by: cbvrexdva2 3318 tfrlem3a 8310 mreexexlemd 17605 r1omhfb 35308 r1omhfbregs 35333 cbviindavw2 36530 cbvixpdavw2 36537 ismnu 44720 |
| Copyright terms: Public domain | W3C validator |