| 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 489 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝑥 = 𝑦) | |
| 2 | cbvraldva2.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵) | |
| 3 | 1, 2 | eleq12d 2859 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
| 4 | cbvraldva2.1 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) | |
| 5 | 3, 4 | imbi12d 347 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑥 ∈ 𝐴 → 𝜓) ↔ (𝑦 ∈ 𝐵 → 𝜒))) |
| 6 | 5 | cbvaldvaw 2061 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜓) ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜒))) |
| 7 | df-ral 3080 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) | |
| 8 | df-ral 3080 | . 2 ⊢ (∀𝑦 ∈ 𝐵 𝜒 ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜒)) | |
| 9 | 6, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1561 = wceq 1563 ∈ wcel 2145 ∀wral 3079 |
| 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 |
| This theorem is referenced by: cbvrexdva2 3342 tfrlem3a 8351 mreexexlemd 17688 r1omhfb 35415 r1omhfbregs 35440 cbviindavw2 36655 cbvixpdavw2 36662 ismnu 44830 |
| Copyright terms: Public domain | W3C validator |