Theorem mppsval 35599

Description: Definition of a provable pre-statement, essentially just a reorganization of the arguments of df-mcls . (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

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

Assertion

Ref	Expression
mppsval	⊢ 𝐽 = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))}

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

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

Proof of Theorem mppsval

Dummy variables 𝑡 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mppsval.j	. 2 ⊢ 𝐽 = (mPPSt‘𝑇)
2		fveq2 6881	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mPreSt‘𝑡) = (mPreSt‘𝑇))
3		mppsval.p	. . . . . . . 8 ⊢ 𝑃 = (mPreSt‘𝑇)
4	2, 3	eqtr4di 2789	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mPreSt‘𝑡) = 𝑃)
5	4	eleq2d 2821	. . . . . 6 ⊢ (𝑡 = 𝑇 → (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ↔ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃))
6		fveq2 6881	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (mCls‘𝑡) = (mCls‘𝑇))
7		mppsval.c	. . . . . . . . 9 ⊢ 𝐶 = (mCls‘𝑇)
8	6, 7	eqtr4di 2789	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mCls‘𝑡) = 𝐶)
9	8	oveqd 7427	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑑(mCls‘𝑡)ℎ) = (𝑑𝐶ℎ))
10	9	eleq2d 2821	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑎 ∈ (𝑑(mCls‘𝑡)ℎ) ↔ 𝑎 ∈ (𝑑𝐶ℎ)))
11	5, 10	anbi12d 632	. . . . 5 ⊢ (𝑡 = 𝑇 → ((⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ∧ 𝑎 ∈ (𝑑(mCls‘𝑡)ℎ)) ↔ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))))
12	11	oprabbidv 7478	. . . 4 ⊢ (𝑡 = 𝑇 → {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ∧ 𝑎 ∈ (𝑑(mCls‘𝑡)ℎ))} = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))})
13		df-mpps 35525	. . . 4 ⊢ mPPSt = (𝑡 ∈ V ↦ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ∧ 𝑎 ∈ (𝑑(mCls‘𝑡)ℎ))})
14	3	fvexi 6895	. . . . 5 ⊢ 𝑃 ∈ V
15	3, 1, 7	mppspstlem 35598	. . . . 5 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ⊆ 𝑃
16	14, 15	ssexi 5297	. . . 4 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ∈ V
17	12, 13, 16	fvmpt 6991	. . 3 ⊢ (𝑇 ∈ V → (mPPSt‘𝑇) = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))})
18		fvprc 6873	. . . 4 ⊢ (¬ 𝑇 ∈ V → (mPPSt‘𝑇) = ∅)
19		df-oprab 7414	. . . . 5 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))}
20		abn0 4365	. . . . . . 7 ⊢ ({𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ≠ ∅ ↔ ∃𝑥∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))))
21		elfvex 6919	. . . . . . . . . . 11 ⊢ (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑇) → 𝑇 ∈ V)
22	21, 3	eleq2s 2853	. . . . . . . . . 10 ⊢ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 → 𝑇 ∈ V)
23	22	ad2antrl 728	. . . . . . . . 9 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑇 ∈ V)
24	23	exlimivv 1932	. . . . . . . 8 ⊢ (∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑇 ∈ V)
25	24	exlimivv 1932	. . . . . . 7 ⊢ (∃𝑥∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑇 ∈ V)
26	20, 25	sylbi 217	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ≠ ∅ → 𝑇 ∈ V)
27	26	necon1bi 2961	. . . . 5 ⊢ (¬ 𝑇 ∈ V → {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} = ∅)
28	19, 27	eqtrid 2783	. . . 4 ⊢ (¬ 𝑇 ∈ V → {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = ∅)
29	18, 28	eqtr4d 2774	. . 3 ⊢ (¬ 𝑇 ∈ V → (mPPSt‘𝑇) = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))})
30	17, 29	pm2.61i 182	. 2 ⊢ (mPPSt‘𝑇) = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))}
31	1, 30	eqtri 2759	1 ⊢ 𝐽 = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))}

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2714   ≠ wne 2933  Vcvv 3464  ∅c0 4313  ⟨cop 4612  ⟨cotp 4614  ‘cfv 6536  (class class class)co 7410  {coprab 7411  mPreStcmpst 35500  mClscmcls 35504  mPPStcmpps 35505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-ot 4615  df-uni 4889  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6538  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpps 35525

This theorem is referenced by:  elmpps  35600  mppspst  35601