Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  supssd Structured version   Visualization version   GIF version

Theorem supssd 32723
Description: Inequality deduction for supremum of a subset. (Contributed by Thierry Arnoux, 21-Mar-2017.)
Hypotheses
Ref Expression
supssd.0 (𝜑𝑅 Or 𝐴)
supssd.1 (𝜑𝐵𝐶)
supssd.2 (𝜑𝐶𝐴)
supssd.3 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
supssd.4 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)))
Assertion
Ref Expression
supssd (𝜑 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅sup(𝐵, 𝐴, 𝑅))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem supssd
StepHypRef Expression
1 supssd.0 . . 3 (𝜑𝑅 Or 𝐴)
2 supssd.4 . . 3 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐶 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐶 𝑦𝑅𝑧)))
31, 2supcl 9527 . 2 (𝜑 → sup(𝐶, 𝐴, 𝑅) ∈ 𝐴)
4 supssd.1 . . . . 5 (𝜑𝐵𝐶)
54sseld 4007 . . . 4 (𝜑 → (𝑧𝐵𝑧𝐶))
61, 2supub 9528 . . . 4 (𝜑 → (𝑧𝐶 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧))
75, 6syld 47 . . 3 (𝜑 → (𝑧𝐵 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧))
87ralrimiv 3151 . 2 (𝜑 → ∀𝑧𝐵 ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧)
9 supssd.3 . . 3 (𝜑 → ∃𝑥𝐴 (∀𝑦𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧𝐵 𝑦𝑅𝑧)))
101, 9supnub 9531 . 2 (𝜑 → ((sup(𝐶, 𝐴, 𝑅) ∈ 𝐴 ∧ ∀𝑧𝐵 ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧) → ¬ sup(𝐶, 𝐴, 𝑅)𝑅sup(𝐵, 𝐴, 𝑅)))
113, 8, 10mp2and 698 1 (𝜑 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅sup(𝐵, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wcel 2108  wral 3067  wrex 3076  wss 3976   class class class wbr 5166   Or wor 5606  supcsup 9509
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-po 5607  df-so 5608  df-iota 6525  df-riota 7404  df-sup 9511
This theorem is referenced by:  xrsupssd  32766
  Copyright terms: Public domain W3C validator