Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvalv | Structured version Visualization version GIF version |
Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2386. See cbvalvw 2039 for a version requiring fewer axioms, to be preferred when sufficient. (Contributed by NM, 5-Aug-1993.) Remove dependency on ax-10 2141, shorten. (Revised by Wolf Lammen, 11-Sep-2023.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cbvalv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvalv | ⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1911 | . 2 ⊢ Ⅎ𝑦𝜑 | |
2 | nfv 1911 | . 2 ⊢ Ⅎ𝑥𝜓 | |
3 | cbvalv.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
4 | 1, 2, 3 | cbval 2412 | 1 ⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-11 2157 ax-12 2173 ax-13 2386 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-nf 1781 |
This theorem is referenced by: cbvexvOLD 2417 cbval2vv 2431 cdeqal1 3761 |
Copyright terms: Public domain | W3C validator |