Theorem spcimgft 3578

Description: A closed version of spcimgf 3580. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
spcimgft.1	⊢ Ⅎ𝑥𝜓
spcimgft.2	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
spcimgft	⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓)))

Proof of Theorem spcimgft

Step	Hyp	Ref	Expression
1		elex 3493	. 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V)
2		spcimgft.2	. . . . 5 ⊢ Ⅎ𝑥𝐴
3	2	issetf 3489	. . . 4 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
4		exim 1837	. . . 4 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑 → 𝜓)))
5	3, 4	biimtrid 241	. . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑 → 𝜓)))
6		spcimgft.1	. . . 4 ⊢ Ⅎ𝑥𝜓
7	6	19.36 2224	. . 3 ⊢ (∃𝑥(𝜑 → 𝜓) ↔ (∀𝑥𝜑 → 𝜓))
8	5, 7	imbitrdi 250	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ V → (∀𝑥𝜑 → 𝜓)))
9	1, 8	syl5 34	1 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓)))

Syntax hints:   → wi 4  ∀wal 1540   = wceq 1542  ∃wex 1782  Ⅎwnf 1786   ∈ wcel 2107  Ⅎwnfc 2884  Vcvv 3475

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-v 3477

This theorem is referenced by:  spcgft  3579  spcimgf  3580  ss2iundf  42410  spcdvw  47724