Theorem mppsval 35540

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 6920	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mPreSt‘𝑡) = (mPreSt‘𝑇))
3		mppsval.p	. . . . . . . 8 ⊢ 𝑃 = (mPreSt‘𝑇)
4	2, 3	eqtr4di 2798	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mPreSt‘𝑡) = 𝑃)
5	4	eleq2d 2830	. . . . . 6 ⊢ (𝑡 = 𝑇 → (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ↔ ⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃))
6		fveq2 6920	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → (mCls‘𝑡) = (mCls‘𝑇))
7		mppsval.c	. . . . . . . . 9 ⊢ 𝐶 = (mCls‘𝑇)
8	6, 7	eqtr4di 2798	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (mCls‘𝑡) = 𝐶)
9	8	oveqd 7465	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑑(mCls‘𝑡)ℎ) = (𝑑𝐶ℎ))
10	9	eleq2d 2830	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑎 ∈ (𝑑(mCls‘𝑡)ℎ) ↔ 𝑎 ∈ (𝑑𝐶ℎ)))
11	5, 10	anbi12d 631	. . . . 5 ⊢ (𝑡 = 𝑇 → ((⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ∧ 𝑎 ∈ (𝑑(mCls‘𝑡)ℎ)) ↔ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))))
12	11	oprabbidv 7516	. . . 4 ⊢ (𝑡 = 𝑇 → {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ∧ 𝑎 ∈ (𝑑(mCls‘𝑡)ℎ))} = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))})
13		df-mpps 35466	. . . 4 ⊢ mPPSt = (𝑡 ∈ V ↦ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑡) ∧ 𝑎 ∈ (𝑑(mCls‘𝑡)ℎ))})
14	3	fvexi 6934	. . . . 5 ⊢ 𝑃 ∈ V
15	3, 1, 7	mppspstlem 35539	. . . . 5 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ⊆ 𝑃
16	14, 15	ssexi 5340	. . . 4 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} ∈ V
17	12, 13, 16	fvmpt 7029	. . 3 ⊢ (𝑇 ∈ V → (mPPSt‘𝑇) = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))})
18		fvprc 6912	. . . 4 ⊢ (¬ 𝑇 ∈ V → (mPPSt‘𝑇) = ∅)
19		df-oprab 7452	. . . . 5 ⊢ {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))}
20		abn0 4408	. . . . . . 7 ⊢ ({𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ≠ ∅ ↔ ∃𝑥∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))))
21		elfvex 6958	. . . . . . . . . . 11 ⊢ (⟨𝑑, ℎ, 𝑎⟩ ∈ (mPreSt‘𝑇) → 𝑇 ∈ V)
22	21, 3	eleq2s 2862	. . . . . . . . . 10 ⊢ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 → 𝑇 ∈ V)
23	22	ad2antrl 727	. . . . . . . . 9 ⊢ ((𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑇 ∈ V)
24	23	exlimivv 1931	. . . . . . . 8 ⊢ (∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑇 ∈ V)
25	24	exlimivv 1931	. . . . . . 7 ⊢ (∃𝑥∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))) → 𝑇 ∈ V)
26	20, 25	sylbi 217	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} ≠ ∅ → 𝑇 ∈ V)
27	26	necon1bi 2975	. . . . 5 ⊢ (¬ 𝑇 ∈ V → {𝑥 ∣ ∃𝑑∃ℎ∃𝑎(𝑥 = ⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∧ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ)))} = ∅)
28	19, 27	eqtrid 2792	. . . 4 ⊢ (¬ 𝑇 ∈ V → {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))} = ∅)
29	18, 28	eqtr4d 2783	. . 3 ⊢ (¬ 𝑇 ∈ V → (mPPSt‘𝑇) = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))})
30	17, 29	pm2.61i 182	. 2 ⊢ (mPPSt‘𝑇) = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))}
31	1, 30	eqtri 2768	1 ⊢ 𝐽 = {⟨⟨𝑑, ℎ⟩, 𝑎⟩ ∣ (⟨𝑑, ℎ, 𝑎⟩ ∈ 𝑃 ∧ 𝑎 ∈ (𝑑𝐶ℎ))}

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  {cab 2717   ≠ wne 2946  Vcvv 3488  ∅c0 4352  ⟨cop 4654  ⟨cotp 4656  ‘cfv 6573  (class class class)co 7448  {coprab 7449  mPreStcmpst 35441  mClscmcls 35445  mPPStcmpps 35446

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-ot 4657  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpps 35466

This theorem is referenced by:  elmpps  35541  mppspst  35542