Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  supex2g Structured version   Visualization version   GIF version

Theorem supex2g 32702
Description: Existence of supremum. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
supex2g (𝐴𝐶 → sup(𝐵, 𝐴, 𝑅) ∈ V)

Proof of Theorem supex2g
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sup 8231 . 2 sup(𝐵, 𝐴, 𝑅) = {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))}
2 rabexg 4739 . . 3 (𝐴𝐶 → {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))} ∈ V)
3 uniexg 6853 . . 3 ({𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))} ∈ V → {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))} ∈ V)
42, 3syl 17 . 2 (𝐴𝐶 {𝑥𝐴 ∣ (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧))} ∈ V)
51, 4syl5eqel 2692 1 (𝐴𝐶 → sup(𝐵, 𝐴, 𝑅) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  wcel 1977  wral 2896  wrex 2897  {crab 2900  Vcvv 3173   cuni 4372   class class class wbr 4583  supcsup 8229
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rex 2902  df-rab 2905  df-v 3175  df-in 3547  df-ss 3554  df-uni 4373  df-sup 8231
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator