ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  exss GIF version

Theorem exss 4276
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 variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rabn0m 3490 . . 3 (∃𝑧 𝑧 ∈ {𝑥𝐴𝜑} ↔ ∃𝑥𝐴 𝜑)
2 df-rab 2494 . . . . 5 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
32eleq2i 2273 . . . 4 (𝑧 ∈ {𝑥𝐴𝜑} ↔ 𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)})
43exbii 1629 . . 3 (∃𝑧 𝑧 ∈ {𝑥𝐴𝜑} ↔ ∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)})
51, 4bitr3i 186 . 2 (∃𝑥𝐴 𝜑 ↔ ∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)})
6 vex 2776 . . . . . 6 𝑧 ∈ V
76snss 3771 . . . . 5 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} ↔ {𝑧} ⊆ {𝑥 ∣ (𝑥𝐴𝜑)})
8 ssab2 3279 . . . . . 6 {𝑥 ∣ (𝑥𝐴𝜑)} ⊆ 𝐴
9 sstr2 3202 . . . . . 6 ({𝑧} ⊆ {𝑥 ∣ (𝑥𝐴𝜑)} → ({𝑥 ∣ (𝑥𝐴𝜑)} ⊆ 𝐴 → {𝑧} ⊆ 𝐴))
108, 9mpi 15 . . . . 5 ({𝑧} ⊆ {𝑥 ∣ (𝑥𝐴𝜑)} → {𝑧} ⊆ 𝐴)
117, 10sylbi 121 . . . 4 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → {𝑧} ⊆ 𝐴)
12 simpr 110 . . . . . . . 8 (([𝑧 / 𝑥]𝑥𝐴 ∧ [𝑧 / 𝑥]𝜑) → [𝑧 / 𝑥]𝜑)
13 equsb1 1809 . . . . . . . . 9 [𝑧 / 𝑥]𝑥 = 𝑧
14 velsn 3652 . . . . . . . . . 10 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
1514sbbii 1789 . . . . . . . . 9 ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ↔ [𝑧 / 𝑥]𝑥 = 𝑧)
1613, 15mpbir 146 . . . . . . . 8 [𝑧 / 𝑥]𝑥 ∈ {𝑧}
1712, 16jctil 312 . . . . . . 7 (([𝑧 / 𝑥]𝑥𝐴 ∧ [𝑧 / 𝑥]𝜑) → ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
18 df-clab 2193 . . . . . . . 8 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} ↔ [𝑧 / 𝑥](𝑥𝐴𝜑))
19 sban 1984 . . . . . . . 8 ([𝑧 / 𝑥](𝑥𝐴𝜑) ↔ ([𝑧 / 𝑥]𝑥𝐴 ∧ [𝑧 / 𝑥]𝜑))
2018, 19bitri 184 . . . . . . 7 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} ↔ ([𝑧 / 𝑥]𝑥𝐴 ∧ [𝑧 / 𝑥]𝜑))
21 df-rab 2494 . . . . . . . . 9 {𝑥 ∈ {𝑧} ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)}
2221eleq2i 2273 . . . . . . . 8 (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ 𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)})
23 df-clab 2193 . . . . . . . . 9 (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)} ↔ [𝑧 / 𝑥](𝑥 ∈ {𝑧} ∧ 𝜑))
24 sban 1984 . . . . . . . . 9 ([𝑧 / 𝑥](𝑥 ∈ {𝑧} ∧ 𝜑) ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
2523, 24bitri 184 . . . . . . . 8 (𝑧 ∈ {𝑥 ∣ (𝑥 ∈ {𝑧} ∧ 𝜑)} ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
2622, 25bitri 184 . . . . . . 7 (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ ([𝑧 / 𝑥]𝑥 ∈ {𝑧} ∧ [𝑧 / 𝑥]𝜑))
2717, 20, 263imtr4i 201 . . . . . 6 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → 𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑})
28 elex2 2790 . . . . . 6 (𝑧 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} → ∃𝑤 𝑤 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑})
2927, 28syl 14 . . . . 5 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → ∃𝑤 𝑤 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑})
30 rabn0m 3490 . . . . 5 (∃𝑤 𝑤 ∈ {𝑥 ∈ {𝑧} ∣ 𝜑} ↔ ∃𝑥 ∈ {𝑧}𝜑)
3129, 30sylib 122 . . . 4 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → ∃𝑥 ∈ {𝑧}𝜑)
326snex 4234 . . . . 5 {𝑧} ∈ V
33 sseq1 3218 . . . . . 6 (𝑦 = {𝑧} → (𝑦𝐴 ↔ {𝑧} ⊆ 𝐴))
34 rexeq 2704 . . . . . 6 (𝑦 = {𝑧} → (∃𝑥𝑦 𝜑 ↔ ∃𝑥 ∈ {𝑧}𝜑))
3533, 34anbi12d 473 . . . . 5 (𝑦 = {𝑧} → ((𝑦𝐴 ∧ ∃𝑥𝑦 𝜑) ↔ ({𝑧} ⊆ 𝐴 ∧ ∃𝑥 ∈ {𝑧}𝜑)))
3632, 35spcev 2870 . . . 4 (({𝑧} ⊆ 𝐴 ∧ ∃𝑥 ∈ {𝑧}𝜑) → ∃𝑦(𝑦𝐴 ∧ ∃𝑥𝑦 𝜑))
3711, 31, 36syl2anc 411 . . 3 (𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → ∃𝑦(𝑦𝐴 ∧ ∃𝑥𝑦 𝜑))
3837exlimiv 1622 . 2 (∃𝑧 𝑧 ∈ {𝑥 ∣ (𝑥𝐴𝜑)} → ∃𝑦(𝑦𝐴 ∧ ∃𝑥𝑦 𝜑))
395, 38sylbi 121 1 (∃𝑥𝐴 𝜑 → ∃𝑦(𝑦𝐴 ∧ ∃𝑥𝑦 𝜑))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1373  wex 1516  [wsb 1786  wcel 2177  {cab 2192  wrex 2486  {crab 2489  wss 3168  {csn 3635
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4167  ax-pow 4223
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-rex 2491  df-rab 2494  df-v 2775  df-in 3174  df-ss 3181  df-pw 3620  df-sn 3641
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator