Mathbox for Wolf Lammen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > wl-cbvalnae | Structured version Visualization version GIF version |
Description: A more general version of cbval 2259 when non-free properties depend on a distinctor. Such expressions arise in proofs aiming at the elimination of distinct variable constraints, specifically in application of dvelimf 2322, nfsb2 2348 or dveeq1 2288. (Contributed by Wolf Lammen, 4-Jun-2019.) |
Ref | Expression |
---|---|
wl-cbvalnae.1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑) |
wl-cbvalnae.2 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜓) |
wl-cbvalnae.3 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
wl-cbvalnae | ⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1721 | . . 3 ⊢ Ⅎ𝑥⊤ | |
2 | nftru 1721 | . . 3 ⊢ Ⅎ𝑦⊤ | |
3 | wl-cbvalnae.1 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑) | |
4 | 3 | a1i 11 | . . 3 ⊢ (⊤ → (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑)) |
5 | wl-cbvalnae.2 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜓) | |
6 | 5 | a1i 11 | . . 3 ⊢ (⊤ → (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜓)) |
7 | wl-cbvalnae.3 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
8 | 7 | a1i 11 | . . 3 ⊢ (⊤ → (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))) |
9 | 1, 2, 4, 6, 8 | wl-cbvalnaed 32498 | . 2 ⊢ (⊤ → (∀𝑥𝜑 ↔ ∀𝑦𝜓)) |
10 | 9 | trud 1484 | 1 ⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∀wal 1473 ⊤wtru 1476 Ⅎwnf 1699 |
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-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |