Theorem opabbrex 5569

Description: A collection of ordered pairs with an extension of a binary relation is a set. (Contributed by Alexander van der Vekens, 1-Nov-2017.)

Hypotheses

Ref	Expression
opabbrex.1	⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (𝑓(𝑉𝑊𝐸)𝑝 → 𝜃))
opabbrex.2	⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ 𝜃} ∈ V)

Assertion

Ref	Expression
opabbrex	⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓)} ∈ V)

Distinct variable groups:   𝑓,𝐸,𝑝   𝑓,𝑉,𝑝

Allowed substitution hints:   𝜓(𝑓,𝑝)   𝜃(𝑓,𝑝)   𝑊(𝑓,𝑝)

Proof of Theorem opabbrex

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-opab 3840	. . 3 ⊢ {⟨𝑓, 𝑝⟩ ∣ 𝜃} = {𝑧 ∣ ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ 𝜃)}
2		opabbrex.2	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ 𝜃} ∈ V)
3	1, 2	syl5eqelr 2166	. 2 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {𝑧 ∣ ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ 𝜃)} ∈ V)
4		df-opab 3840	. . 3 ⊢ {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓)} = {𝑧 ∣ ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓))}
5		opabbrex.1	. . . . . . 7 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (𝑓(𝑉𝑊𝐸)𝑝 → 𝜃))
6	5	adantrd 273	. . . . . 6 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → ((𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓) → 𝜃))
7	6	anim2d 330	. . . . 5 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → ((𝑧 = ⟨𝑓, 𝑝⟩ ∧ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓)) → (𝑧 = ⟨𝑓, 𝑝⟩ ∧ 𝜃)))
8	7	2eximdv 1803	. . . 4 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓)) → ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ 𝜃)))
9	8	ss2abdv 3067	. . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {𝑧 ∣ ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓))} ⊆ {𝑧 ∣ ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ 𝜃)})
10	4, 9	syl5eqss 3043	. 2 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓)} ⊆ {𝑧 ∣ ∃𝑓∃𝑝(𝑧 = ⟨𝑓, 𝑝⟩ ∧ 𝜃)})
11	3, 10	ssexd 3918	1 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → {⟨𝑓, 𝑝⟩ ∣ (𝑓(𝑉𝑊𝐸)𝑝 ∧ 𝜓)} ∈ V)

Syntax hints:   → wi 4   ∧ wa 102   = wceq 1284  ∃wex 1421   ∈ wcel 1433  {cab 2067  Vcvv 2601  ⟨cop 3401   class class class wbr 3785  {copab 3838  (class class class)co 5532

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-in 2979  df-ss 2986  df-opab 3840

This theorem is referenced by:  sprmpt2  5880