Theorem mppspstlem 35806

Description: Lemma for mppspst 35809. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mppsval.p	⊢ 𝑃 = (mPreSt‘𝑇)
mppsval.j	⊢ 𝐽 = (mPPSt‘𝑇)
mppsval.c	⊢ 𝐶 = (mCls‘𝑇)

Assertion

Ref	Expression
mppspstlem	⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ⊆ 𝑃

Distinct variable groups:   𝑎,𝑑,ℎ,𝐶   𝑃,𝑎,𝑑,ℎ   𝑇,𝑎,𝑑,ℎ

Allowed substitution hints:   𝐽(ℎ,𝑎,𝑑)

Proof of Theorem mppspstlem

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-oprab 7367	. 2 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))}
2		df-ot 4571	. . . . . . . . . 10 ⊢ ⟨𝑑, ℎ, 𝑎⟩ = ⟨⟨𝑑, ℎ⟩, 𝑎⟩
3	2	eqeq2i 2753	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑑, ℎ, 𝑎⟩ ↔ 𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩)
4	3	biimpri 229	. . . . . . . 8 ⊢ (𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ → 𝑥 = ⟨𝑑, ℎ, 𝑎⟩)
5	4	eleq1d 2825	. . . . . . 7 ⊢ (𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ → (𝑥 ∈ 𝑃 ↔ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃))
6	5	biimpar 478	. . . . . 6 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃) → 𝑥 ∈ 𝑃)
7	6	adantrr 723	. . . . 5 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
8	7	exlimiv 1937	. . . 4 ⊢ (∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
9	8	exlimivv 1939	. . 3 ⊢ (∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
10	9	abssi 4006	. 2 ⊢ {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ⊆ 𝑃
11	1, 10	eqsstri 3968	1 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ⊆ 𝑃

Syntax hints:   ∧ wa 396   = wceq 1547  ∃wex 1786   ∈ wcel 2119  {cab 2718   ⊆ wss 3890  ⟨cop 4568  ⟨cotp 4570  ‘cfv 6492  (class class class)co 7363  {coprab 7364  mPreStcmpst 35708  mClscmcls 35712  mPPStcmpps 35713

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712

This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ss 3907  df-ot 4571  df-oprab 7367

This theorem is referenced by:  mppsval  35807  mppspst  35809