MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  supssd Structured version   Visualization version   GIF version

Theorem supssd 9492
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 9487 . 2 (𝜑 → sup(𝐶, 𝐴, 𝑅) ∈ 𝐴)
4 supssd.1 . . . . 5 (𝜑 → 𝐵 ⊆ 𝐶)
54sseld 3912 . . . 4 (𝜑 → (𝑧 ∈ 𝐵 → 𝑧 ∈ 𝐶))
61, 2supub 9488 . . . 4 (𝜑 → (𝑧 ∈ 𝐶 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧))
75, 6syld 48 . . 3 (𝜑 → (𝑧 ∈ 𝐵 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧))
87ralrimiv 3157 . 2 (𝜑 → ∀𝑧 ∈ 𝐵 ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧)
9 supssd.3 . . 3 (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
101, 9supnub 9491 . 2 (𝜑 → ((sup(𝐶, 𝐴, 𝑅) ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐵 ¬ sup(𝐶, 𝐴, 𝑅)𝑅𝑧) → ¬ sup(𝐶, 𝐴, 𝑅)𝑅sup(𝐵, 𝐴, 𝑅)))
113, 8, 10mp2and 712 1 (𝜑 → ¬ sup(𝐶, 𝐴, 𝑅)𝑅sup(𝐵, 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   class class class wbr 5108   Or wor 5565  supcsup 9469
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-po 5566  df-so 5567  df-iota 6520  df-riota 7408  df-sup 9471
This theorem is used by:  xrsupssd  13503
  Copyright terms: Public domain W3C validator