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

Theorem sup0 9358
Description: The supremum of an empty set under a base set which has a unique smallest element is the smallest element of the base set. (Contributed by AV, 4-Sep-2020.)
Assertion
Ref Expression
sup0 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = 𝑋)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦   𝑥,𝑋,𝑦

Proof of Theorem sup0
StepHypRef Expression
1 sup0riota 9357 . . 3 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
213ad2ant1 1133 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
3 simp2r 1201 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → ∀𝑦𝐴 ¬ 𝑦𝑅𝑋)
4 simpl 482 . . . . . 6 ((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) → 𝑋𝐴)
54anim1i 615 . . . . 5 (((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
653adant1 1130 . . . 4 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
7 breq2 5097 . . . . . . 7 (𝑥 = 𝑋 → (𝑦𝑅𝑥𝑦𝑅𝑋))
87notbid 318 . . . . . 6 (𝑥 = 𝑋 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑋))
98ralbidv 3156 . . . . 5 (𝑥 = 𝑋 → (∀𝑦𝐴 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋))
109riota2 7334 . . . 4 ((𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (∀𝑦𝐴 ¬ 𝑦𝑅𝑋 ↔ (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋))
116, 10syl 17 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (∀𝑦𝐴 ¬ 𝑦𝑅𝑋 ↔ (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋))
123, 11mpbid 232 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋)
132, 12eqtrd 2768 1 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3048  ∃!wreu 3345  c0 4282   class class class wbr 5093   Or wor 5526  crio 7308  supcsup 9331
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-po 5527  df-so 5528  df-iota 6442  df-riota 7309  df-sup 9333
This theorem is referenced by:  infempty  9400
  Copyright terms: Public domain W3C validator