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

Theorem sup0 9504
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 9503 . . 3 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
213ad2ant1 1132 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
3 simp2r 1199 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → ∀𝑦𝐴 ¬ 𝑦𝑅𝑋)
4 simpl 482 . . . . . 6 ((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) → 𝑋𝐴)
54anim1i 615 . . . . 5 (((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
653adant1 1129 . . . 4 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
7 breq2 5152 . . . . . . 7 (𝑥 = 𝑋 → (𝑦𝑅𝑥𝑦𝑅𝑋))
87notbid 318 . . . . . 6 (𝑥 = 𝑋 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑋))
98ralbidv 3176 . . . . 5 (𝑥 = 𝑋 → (∀𝑦𝐴 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋))
109riota2 7413 . . . 4 ((𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (∀𝑦𝐴 ¬ 𝑦𝑅𝑋 ↔ (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋))
116, 10syl 17 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (∀𝑦𝐴 ¬ 𝑦𝑅𝑋 ↔ (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋))
123, 11mpbid 232 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋)
132, 12eqtrd 2775 1 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059  ∃!wreu 3376  c0 4339   class class class wbr 5148   Or wor 5596  crio 7387  supcsup 9478
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-po 5597  df-so 5598  df-iota 6516  df-riota 7388  df-sup 9480
This theorem is referenced by:  infempty  9545
  Copyright terms: Public domain W3C validator