Theorem exss 5372

Description: Restricted existence in a class (even if proper) implies restricted existence in a subset. (Contributed by NM, 23-Aug-2003.)

Assertion

Ref	Expression
exss	⊢ (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))

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

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem exss

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rab 3072	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
2	1	neeq1i 3007	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅ ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ≠ ∅)
3		rabn0 4316	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝜑)
4		n0 4277	. . 3 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ≠ ∅ ↔ ∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
5	2, 3, 4	3bitr3i 300	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
6		vex 3426	. . . . . 6 ⊢ 𝑧 ∈ V
7	6	snss 4716	. . . . 5 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ {𝑧} ⊆ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
8		ssab2 4008	. . . . . 6 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴
9		sstr2 3924	. . . . . 6 ⊢ ({𝑧} ⊆ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴 → {𝑧} ⊆ 𝐴))
10	8, 9	mpi 20	. . . . 5 ⊢ ({𝑧} ⊆ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → {𝑧} ⊆ 𝐴)
11	7, 10	sylbi 216	. . . 4 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → {𝑧} ⊆ 𝐴)
12		simpr 484	. . . . . . . 8 ⊢ (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) → [𝑧 / 𝑥]𝜑)
13		equsb1v 2105	. . . . . . . . 9 ⊢ [𝑧 / 𝑥]𝑥 = 𝑧
14		velsn 4574	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
15	14	sbbii 2080	. . . . . . . . 9 ⊢ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ↔ [𝑧 / 𝑥]𝑥 = 𝑧)
16	13, 15	mpbir 230	. . . . . . . 8 ⊢ [𝑧 / 𝑥]𝑥 ∈ {𝑧}
17	12, 16	jctil 519	. . . . . . 7 ⊢ (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) → ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
18		df-clab 2716	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ [𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑))
19		sban 2084	. . . . . . . 8 ⊢ ([𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
20	18, 19	bitri 274	. . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
21		df-rab 3072	. . . . . . . . 9 ⊢ {𝑥 ∈ {𝑧} ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)}
22	21	eleq2i 2830	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)})
23		df-clab 2716	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)} ↔ [𝑧 / 𝑥](𝑥 ∈ {𝑧} ∧ 𝜑))
24		sban 2084	. . . . . . . 8 ⊢ ([𝑧 / 𝑥](𝑥 ∈ {𝑧} ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
25	22, 23, 24	3bitri 296	. . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
26	17, 20, 25	3imtr4i 291	. . . . . 6 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → 𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑})
27	26	ne0d 4266	. . . . 5 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → {𝑥 ∈ {𝑧} ∣ 𝜑} ≠ ∅)
28		rabn0 4316	. . . . 5 ⊢ ({𝑥 ∈ {𝑧} ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ {𝑧}𝜑)
29	27, 28	sylib 217	. . . 4 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∃𝑥 ∈ {𝑧}𝜑)
30		snex 5349	. . . . 5 ⊢ {𝑧} ∈ V
31		sseq1 3942	. . . . . 6 ⊢ (𝑦 = {𝑧} → (𝑦 ⊆ 𝐴 ↔ {𝑧} ⊆ 𝐴))
32		rexeq 3334	. . . . . 6 ⊢ (𝑦 = {𝑧} → (∃𝑥 ∈ 𝑦 𝜑 ↔ ∃𝑥 ∈ {𝑧}𝜑))
33	31, 32	anbi12d 630	. . . . 5 ⊢ (𝑦 = {𝑧} → ((𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑) ↔ ({𝑧} ⊆ 𝐴 ∧ ∃𝑥 ∈ {𝑧}𝜑)))
34	30, 33	spcev 3535	. . . 4 ⊢ (({𝑧} ⊆ 𝐴 ∧ ∃𝑥 ∈ {𝑧}𝜑) → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))
35	11, 29, 34	syl2anc 583	. . 3 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))
36	35	exlimiv 1934	. 2 ⊢ (∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))
37	5, 36	sylbi 216	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539  ∃wex 1783  [wsb 2068   ∈ wcel 2108  {cab 2715   ≠ wne 2942  ∃wrex 3064  {crab 3067   ⊆ wss 3883  ∅c0 4253  {csn 4558

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-sn 4559  df-pr 4561

This theorem is referenced by: (None)