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 47286
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 1928 . 2 (𝜑 → ∀𝑥𝑦(𝑥𝑅𝑦 → (𝑥𝐶𝜃)))
6 opabresex0d.c . . 3 (𝜑𝐶𝑊)
7 opabresex0d.y . . . 4 ((𝜑𝑥𝐶) → {𝑦𝜃} ∈ 𝑉)
87elexd 3471 . . 3 ((𝜑𝑥𝐶) → {𝑦𝜃} ∈ V)
96, 8opabex3d 7944 . 2 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜃)} ∈ V)
10 opabbrex 7440 . 2 ((∀𝑥𝑦(𝑥𝑅𝑦 → (𝑥𝐶𝜃)) ∧ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜃)} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} ∈ V)
115, 9, 10syl2anc 584 1 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝜓)} ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wal 1538  wcel 2109  {cab 2707  Vcvv 3447   class class class wbr 5107  {copab 5169
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 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
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 2533  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-opab 5170  df-xp 5644  df-rel 5645
This theorem is referenced by:  opabbrfex0d  47287  opabresexd  47288
  Copyright terms: Public domain W3C validator