Theorem mppspstlem 36516

Description: Lemma for mppspst 36519. (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 7450	. 2 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))}
2		df-ot 4862	. . . . . . . . . 10 ⊢ ⟨𝑑, ℎ, 𝑎⟩ = ⟨⟨𝑑, ℎ⟩, 𝑎⟩
3	2	eqeq2i 2776	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑑, ℎ, 𝑎⟩ ↔ 𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩)
4	3	biimpri 231	. . . . . . . 8 ⊢ (𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ → 𝑥 = ⟨𝑑, ℎ, 𝑎⟩)
5	4	eleq1d 2849	. . . . . . 7 ⊢ (𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ → (𝑥 ∈ 𝑃 ↔ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃))
6	5	biimpar 483	. . . . . 6 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃) → 𝑥 ∈ 𝑃)
7	6	adantrr 730	. . . . 5 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
8	7	exlimiv 1965	. . . 4 ⊢ (∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
9	8	exlimivv 1967	. . 3 ⊢ (∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑥 ∈ 𝑃)
10	9	abssi 3996	. 2 ⊢ {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ⊆ 𝑃
11	1, 10	eqsstri 3959	1 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ⊆ 𝑃

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ⊆ wss 3900  ⟨cop 4838  ⟨cotp 4861  ‘cfv 6561  (class class class)co 7446  {coprab 7447  mPreStcmpst 36418  mClscmcls 36422  mPPStcmpps 36423

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ss 3901  df-ot 4862  df-oprab 7450

This theorem is used by:  mppsval  36517  mppspst  36519