Theorem drex1v 2362

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Version of drex1 2434 with a disjoint variable condition, which does not require ax-13 2365. (Contributed by NM, 27-Feb-2005.) (Revised by BJ, 17-Jun-2019.)

Hypothesis

Ref	Expression
dral1v.1	⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
drex1v	⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝜑 ↔ ∃𝑦𝜓))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem drex1v

Step	Hyp	Ref	Expression
1		dral1v.1	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2	1	notbid 318	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓))
3	2	dral1v 2360	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 ¬ 𝜑 ↔ ∀𝑦 ¬ 𝜓))
4	3	notbid 318	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 ¬ 𝜑 ↔ ¬ ∀𝑦 ¬ 𝜓))
5		df-ex 1774	. 2 ⊢ (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑)
6		df-ex 1774	. 2 ⊢ (∃𝑦𝜓 ↔ ¬ ∀𝑦 ¬ 𝜓)
7	4, 5, 6	3bitr4g 314	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝜑 ↔ ∃𝑦𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205  ∀wal 1531  ∃wex 1773

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-12 2163

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1774

This theorem is referenced by:  drnf1v  2363  copsexgw  5483  oprabidw  7436