Theorem spcimdv 3578

Description: Restricted specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.) Avoid ax-10 2129 and ax-11 2146. (Revised by Gino Giotto, 20-Aug-2023.)

Hypotheses

Ref	Expression
spcimdv.1	⊢ (𝜑 → 𝐴 ∈ 𝐵)
spcimdv.2	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒))

Assertion

Ref	Expression
spcimdv	⊢ (𝜑 → (∀𝑥𝜓 → 𝜒))

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝜒,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝐵(𝑥)

Proof of Theorem spcimdv

Step	Hyp	Ref	Expression
1		spcimdv.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
2		elisset 2807	. . . 4 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴)
3	1, 2	syl 17	. . 3 ⊢ (𝜑 → ∃𝑥 𝑥 = 𝐴)
4		spcimdv.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒))
5	4	ex 411	. . . 4 ⊢ (𝜑 → (𝑥 = 𝐴 → (𝜓 → 𝜒)))
6	5	eximdv 1912	. . 3 ⊢ (𝜑 → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜓 → 𝜒)))
7	3, 6	mpd 15	. 2 ⊢ (𝜑 → ∃𝑥(𝜓 → 𝜒))
8		19.36v 1983	. 2 ⊢ (∃𝑥(𝜓 → 𝜒) ↔ (∀𝑥𝜓 → 𝜒))
9	7, 8	sylib 217	1 ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒))

Syntax hints:   → wi 4   ∧ wa 394  ∀wal 1531   = wceq 1533  ∃wex 1773   ∈ wcel 2098

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-8 2100

This theorem depends on definitions:  df-bi 206  df-an 395  df-tru 1536  df-ex 1774  df-sb 2060  df-clab 2703  df-clel 2802

This theorem is referenced by:  spcdv  3579  spcimedv  3580  rspcimdv  3597  mrieqv2d  17619  mreexexlemd  17624  intabssd  43031

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »