Theorem elmpst 36123

Description: Property of being a pre-statement. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mpstval.v	⊢ 𝑉 = (mDV‘𝑇)
mpstval.e	⊢ 𝐸 = (mEx‘𝑇)
mpstval.p	⊢ 𝑃 = (mPreSt‘𝑇)

Assertion

Ref	Expression
elmpst	⊢ (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃 ↔ ((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin) ∧ 𝐴 ∈ 𝐸))

Proof of Theorem elmpst

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opelxp 5695	. . 3 ⊢ (⟨⟨𝐷, 𝐻⟩, 𝐴⟩ ∈ (({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸) ↔ (⟨𝐷, 𝐻⟩ ∈ ({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) ∧ 𝐴 ∈ 𝐸))
2		opelxp 5695	. . . . 5 ⊢ (⟨𝐷, 𝐻⟩ ∈ ({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) ↔ (𝐷 ∈ {𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} ∧ 𝐻 ∈ (𝒫 𝐸 ∩ Fin)))
3		cnveq 5857	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → ◡𝑑 = ◡𝐷)
4		id 23	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → 𝑑 = 𝐷)
5	3, 4	eqeq12d 2778	. . . . . . . 8 ⊢ (𝑑 = 𝐷 → (◡𝑑 = 𝑑 ↔ ◡𝐷 = 𝐷))
6	5	elrab 3648	. . . . . . 7 ⊢ (𝐷 ∈ {𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} ↔ (𝐷 ∈ 𝒫 𝑉 ∧ ◡𝐷 = 𝐷))
7		mpstval.v	. . . . . . . . . 10 ⊢ 𝑉 = (mDV‘𝑇)
8	7	fvexi 6896	. . . . . . . . 9 ⊢ 𝑉 ∈ V
9	8	elpw2 5303	. . . . . . . 8 ⊢ (𝐷 ∈ 𝒫 𝑉 ↔ 𝐷 ⊆ 𝑉)
10	9	anbi1i 636	. . . . . . 7 ⊢ ((𝐷 ∈ 𝒫 𝑉 ∧ ◡𝐷 = 𝐷) ↔ (𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷))
11	6, 10	bitri 278	. . . . . 6 ⊢ (𝐷 ∈ {𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} ↔ (𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷))
12		elfpw 9325	. . . . . 6 ⊢ (𝐻 ∈ (𝒫 𝐸 ∩ Fin) ↔ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin))
13	11, 12	anbi12i 640	. . . . 5 ⊢ ((𝐷 ∈ {𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} ∧ 𝐻 ∈ (𝒫 𝐸 ∩ Fin)) ↔ ((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin)))
14	2, 13	bitri 278	. . . 4 ⊢ (⟨𝐷, 𝐻⟩ ∈ ({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) ↔ ((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin)))
15	14	anbi1i 636	. . 3 ⊢ ((⟨𝐷, 𝐻⟩ ∈ ({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) ∧ 𝐴 ∈ 𝐸) ↔ (((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin)) ∧ 𝐴 ∈ 𝐸))
16	1, 15	bitri 278	. 2 ⊢ (⟨⟨𝐷, 𝐻⟩, 𝐴⟩ ∈ (({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸) ↔ (((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin)) ∧ 𝐴 ∈ 𝐸))
17		df-ot 4596	. . 3 ⊢ ⟨𝐷, 𝐻, 𝐴⟩ = ⟨⟨𝐷, 𝐻⟩, 𝐴⟩
18		mpstval.e	. . . 4 ⊢ 𝐸 = (mEx‘𝑇)
19		mpstval.p	. . . 4 ⊢ 𝑃 = (mPreSt‘𝑇)
20	7, 18, 19	mpstval 36122	. . 3 ⊢ 𝑃 = (({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸)
21	17, 20	eleq12i 2855	. 2 ⊢ (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃 ↔ ⟨⟨𝐷, 𝐻⟩, 𝐴⟩ ∈ (({𝑑 ∈ 𝒫 𝑉 ∣ ◡𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸))
22		df-3an 1105	. 2 ⊢ (((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin) ∧ 𝐴 ∈ 𝐸) ↔ (((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin)) ∧ 𝐴 ∈ 𝐸))
23	16, 21, 22	3bitr4i 306	1 ⊢ (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃 ↔ ((𝐷 ⊆ 𝑉 ∧ ◡𝐷 = 𝐷) ∧ (𝐻 ⊆ 𝐸 ∧ 𝐻 ∈ Fin) ∧ 𝐴 ∈ 𝐸))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {crab 3414   ∩ cin 3901   ⊆ wss 3902  𝒫 cpw 4560  ⟨cop 4593  ⟨cotp 4595   × cxp 5657  ^◡ccnv 5658  ‘cfv 6537  Fincfn 8956  mExcmex 36054  mDVcmdv 36055  mPreStcmpst 36060

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-ot 4596  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-mpst 36080

This theorem is used by:  msrval  36125  msrf  36129  mclsssvlem  36149  mclsax  36156  mclsind  36157  mthmpps  36169  mclsppslem  36170  mclspps  36171