Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  opabresex0d Structured version   Visualization version   GIF version

Theorem opabresex0d 47295
Description: A collection of ordered pairs, the class of all possible second components being a set, with a restriction of a binary relation is a set. (Contributed by Alexander van der Vekens, 1-Nov-2017.) (Revised by AV, 1-Jan-2021.)
Hypotheses
Ref Expression
opabresex0d.x ((𝜑𝑥𝑅𝑦) → 𝑥𝐶)
opabresex0d.t ((𝜑𝑥𝑅𝑦) → 𝜃)
opabresex0d.y ((𝜑𝑥𝐶) → {𝑦𝜃} ∈ 𝑉)
opabresex0d.c (𝜑𝐶𝑊)
Assertion
Ref Expression
opabresex0d (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} ∈ V)
Distinct variable groups:   𝑥,𝐶,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜓(𝑥,𝑦)   𝜃(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem opabresex0d
StepHypRef Expression
1 opabresex0d.x . . . . 5 ((𝜑𝑥𝑅𝑦) → 𝑥𝐶)
2 opabresex0d.t . . . . 5 ((𝜑𝑥𝑅𝑦) → 𝜃)
31, 2jca 511 . . . 4 ((𝜑𝑥𝑅𝑦) → (𝑥𝐶𝜃))
43ex 412 . . 3 (𝜑 → (𝑥𝑅𝑦 → (𝑥𝐶𝜃)))
54alrimivv 1929 . 2 (𝜑 → ∀𝑥𝑦(𝑥𝑅𝑦 → (𝑥𝐶𝜃)))
6 opabresex0d.c . . 3 (𝜑𝐶𝑊)
7 opabresex0d.y . . . 4 ((𝜑𝑥𝐶) → {𝑦𝜃} ∈ 𝑉)
87elexd 3458 . . 3 ((𝜑𝑥𝐶) → {𝑦𝜃} ∈ V)
96, 8opabex3d 7892 . 2 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜃)} ∈ V)
10 opabbrex 7394 . 2 ((∀𝑥𝑦(𝑥𝑅𝑦 → (𝑥𝐶𝜃)) ∧ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜃)} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} ∈ V)
115, 9, 10syl2anc 584 1 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wal 1539  wcel 2110  {cab 2708  Vcvv 3434   class class class wbr 5089  {copab 5151
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3394  df-v 3436  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-opab 5152  df-xp 5620  df-rel 5621
This theorem is referenced by:  opabbrfex0d  47296  opabresexd  47297
  Copyright terms: Public domain W3C validator