Theorem wl-cbvalnae 34767

Description: A more general version of cbval 2412 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 2466, nfsb2 2518 or dveeq1 2394. (Contributed by Wolf Lammen, 4-Jun-2019.)

Hypotheses

Ref	Expression
wl-cbvalnae.1	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑)
wl-cbvalnae.2	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜓)
wl-cbvalnae.3	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
wl-cbvalnae	⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓)

Proof of Theorem wl-cbvalnae

Step	Hyp	Ref	Expression
1		nftru 1801	. . 3 ⊢ Ⅎ𝑥⊤
2		nftru 1801	. . 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 34766	. 2 ⊢ (⊤ → (∀𝑥𝜑 ↔ ∀𝑦𝜓))
10	9	mptru 1540	1 ⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208  ∀wal 1531  ⊤wtru 1534  Ⅎwnf 1780

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-10 2141  ax-11 2157  ax-12 2173  ax-13 2386

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781

This theorem is referenced by: (None)