Theorem spcimedv 3581

Description: Restricted existential specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

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

Assertion

Ref	Expression
spcimedv	⊢ (𝜑 → (𝜒 → ∃𝑥𝜓))

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

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

Proof of Theorem spcimedv

Step	Hyp	Ref	Expression
1		spcimdv.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
2		spcimedv.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜒 → 𝜓))
3	2	con3d 152	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (¬ 𝜓 → ¬ 𝜒))
4	1, 3	spcimdv 3579	. . 3 ⊢ (𝜑 → (∀𝑥 ¬ 𝜓 → ¬ 𝜒))
5	4	con2d 134	. 2 ⊢ (𝜑 → (𝜒 → ¬ ∀𝑥 ¬ 𝜓))
6		df-ex 1775	. 2 ⊢ (∃𝑥𝜓 ↔ ¬ ∀𝑥 ¬ 𝜓)
7	5, 6	imbitrrdi 251	1 ⊢ (𝜑 → (𝜒 → ∃𝑥𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395  ∀wal 1532   = wceq 1534  ∃wex 1774   ∈ wcel 2099

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1537  df-ex 1775  df-sb 2061  df-clab 2706  df-clel 2806

This theorem is referenced by:  spc3egv  3589  hashf1rn  14337  cshwsexaOLD  14801  wwlktovfo  14935  uvcendim  21774  wlkiswwlks2  29679  wwlksnextsurj  29704  elwwlks2  29770  elwspths2spth  29771  clwlkclwwlklem1  29802  sticksstones4  41615  rtrclex  43041  clcnvlem  43047  iunrelexpuztr  43143

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

OSZAR »