Theorem mppspstlem 36422

Description: Lemma for mppspst 36425. (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 7424	. 2 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))}
2		df-ot 4858	. . . . . . . . . 10 ⊢ ⟨𝑑, ℎ, 𝑎⟩ = ⟨⟨𝑑, ℎ⟩, 𝑎⟩
3	2	eqeq2i 2773	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑑, ℎ, 𝑎⟩ ↔ 𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩)
4	3	biimpri 231	. . . . . . . 8 ⊢ (𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ → 𝑥 = ⟨𝑑, ℎ, 𝑎⟩)
5	4	eleq1d 2845	. . . . . . 7 ⊢ (𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ → (𝑥 ∈ 𝑃 ↔ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃))
6	5	biimpar 483	. . . . . 6 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃) → 𝑥 ∈ 𝑃)
7	6	adantrr 730	. . . . 5 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
8	7	exlimiv 1962	. . . 4 ⊢ (∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
9	8	exlimivv 1964	. . 3 ⊢ (∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
10	9	abssi 3993	. 2 ⊢ {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ⊆ 𝑃
11	1, 10	eqsstri 3954	1 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ⊆ 𝑃

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738   ⊆ wss 3895  ⟨cop 4834  ⟨cotp 4857  ‘cfv 6538  (class class class)co 7420  {coprab 7421  mPreStcmpst 36324  mClscmcls 36328  mPPStcmpps 36329

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ss 3896  df-ot 4858  df-oprab 7424

This theorem is used by:  mppsval  36423  mppspst  36425