Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvaldva | Structured version Visualization version GIF version |
Description: Rule used to change the bound variable in a universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) Remove dependency on ax-10 2006. (Revised by Wolf Lammen, 18-Jul-2021.) |
Ref | Expression |
---|---|
cbvaldva.1 | ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
cbvaldva | ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvaldva.1 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) | |
2 | 1 | expcom 450 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 → (𝜓 ↔ 𝜒))) |
3 | 2 | pm5.74d 261 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜒))) |
4 | 3 | cbvalv 2261 | . . 3 ⊢ (∀𝑥(𝜑 → 𝜓) ↔ ∀𝑦(𝜑 → 𝜒)) |
5 | 19.21v 1855 | . . 3 ⊢ (∀𝑥(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥𝜓)) | |
6 | 19.21v 1855 | . . 3 ⊢ (∀𝑦(𝜑 → 𝜒) ↔ (𝜑 → ∀𝑦𝜒)) | |
7 | 4, 5, 6 | 3bitr3i 289 | . 2 ⊢ ((𝜑 → ∀𝑥𝜓) ↔ (𝜑 → ∀𝑦𝜒)) |
8 | 7 | pm5.74ri 260 | 1 ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∀wal 1473 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 |
This theorem depends on definitions: df-bi 196 df-an 385 df-ex 1696 df-nf 1701 |
This theorem is referenced by: cbvexdva 2271 cbval2v 2273 cbvraldva2 3151 |
Copyright terms: Public domain | W3C validator |