Theorem exss 5347

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 3070	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
2	1	neeq1i 3005	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅ ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ≠ ∅)
3		rabn0 4300	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝜑)
4		n0 4261	. . 3 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ≠ ∅ ↔ ∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
5	2, 3, 4	3bitr3i 304	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
6		vex 3412	. . . . . 6 ⊢ 𝑧 ∈ V
7	6	snss 4699	. . . . 5 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ {𝑧} ⊆ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)})
8		ssab2 3992	. . . . . 6 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴
9		sstr2 3908	. . . . . 6 ⊢ ({𝑧} ⊆ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴 → {𝑧} ⊆ 𝐴))
10	8, 9	mpi 20	. . . . 5 ⊢ ({𝑧} ⊆ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → {𝑧} ⊆ 𝐴)
11	7, 10	sylbi 220	. . . 4 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → {𝑧} ⊆ 𝐴)
12		simpr 488	. . . . . . . 8 ⊢ (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) → [𝑧 / 𝑥]𝜑)
13		equsb1v 2107	. . . . . . . . 9 ⊢ [𝑧 / 𝑥]𝑥 = 𝑧
14		velsn 4557	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
15	14	sbbii 2082	. . . . . . . . 9 ⊢ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ↔ [𝑧 / 𝑥]𝑥 = 𝑧)
16	13, 15	mpbir 234	. . . . . . . 8 ⊢ [𝑧 / 𝑥]𝑥 ∈ {𝑧}
17	12, 16	jctil 523	. . . . . . 7 ⊢ (([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑) → ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
18		df-clab 2715	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ [𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑))
19		sban 2086	. . . . . . . 8 ⊢ ([𝑧 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
20	18, 19	bitri 278	. . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ([𝑧 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑧 / 𝑥]𝜑))
21		df-rab 3070	. . . . . . . . 9 ⊢ {𝑥 ∈ {𝑧} ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)}
22	21	eleq2i 2829	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)})
23		df-clab 2715	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)} ↔ [𝑧 / 𝑥](𝑥 ∈ {𝑧} ∧ 𝜑))
24		sban 2086	. . . . . . . 8 ⊢ ([𝑧 / 𝑥](𝑥 ∈ {𝑧} ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
25	22, 23, 24	3bitri 300	. . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
26	17, 20, 25	3imtr4i 295	. . . . . 6 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → 𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑})
27	26	ne0d 4250	. . . . 5 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → {𝑥 ∈ {𝑧} ∣ 𝜑} ≠ ∅)
28		rabn0 4300	. . . . 5 ⊢ ({𝑥 ∈ {𝑧} ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ {𝑧}𝜑)
29	27, 28	sylib 221	. . . 4 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∃𝑥 ∈ {𝑧}𝜑)
30		snex 5324	. . . . 5 ⊢ {𝑧} ∈ V
31		sseq1 3926	. . . . . 6 ⊢ (𝑦 = {𝑧} → (𝑦 ⊆ 𝐴 ↔ {𝑧} ⊆ 𝐴))
32		rexeq 3320	. . . . . 6 ⊢ (𝑦 = {𝑧} → (∃𝑥 ∈ 𝑦 𝜑 ↔ ∃𝑥 ∈ {𝑧}𝜑))
33	31, 32	anbi12d 634	. . . . 5 ⊢ (𝑦 = {𝑧} → ((𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑) ↔ ({𝑧} ⊆ 𝐴 ∧ ∃𝑥 ∈ {𝑧}𝜑)))
34	30, 33	spcev 3521	. . . 4 ⊢ (({𝑧} ⊆ 𝐴 ∧ ∃𝑥 ∈ {𝑧}𝜑) → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))
35	11, 29, 34	syl2anc 587	. . 3 ⊢ (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))
36	35	exlimiv 1938	. 2 ⊢ (∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))
37	5, 36	sylbi 220	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑦(𝑦 ⊆ 𝐴 ∧ ∃𝑥 ∈ 𝑦 𝜑))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1543  ∃wex 1787  [wsb 2070   ∈ wcel 2110  {cab 2714   ≠ wne 2940  ∃wrex 3062  {crab 3065   ⊆ wss 3866  ∅c0 4237  {csn 4541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pr 5322

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-sn 4542  df-pr 4544

This theorem is referenced by: (None)