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

Theorem sup0 9377
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 9376 . . 3 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
213ad2ant1 1139 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
3 simp2r 1207 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → ∀𝑦𝐴 ¬ 𝑦𝑅𝑋)
4 simpl 483 . . . . . 6 ((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) → 𝑋𝐴)
54anim1i 621 . . . . 5 (((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
653adant1 1136 . . . 4 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
7 breq2 5083 . . . . . . 7 (𝑥 = 𝑋 → (𝑦𝑅𝑥𝑦𝑅𝑋))
87notbid 319 . . . . . 6 (𝑥 = 𝑋 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑋))
98ralbidv 3163 . . . . 5 (𝑥 = 𝑋 → (∀𝑦𝐴 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋))
109riota2 7345 . . . 4 ((𝑋𝐴 ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (∀𝑦𝐴 ¬ 𝑦𝑅𝑋 ↔ (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋))
116, 10syl 17 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (∀𝑦𝐴 ¬ 𝑦𝑅𝑋 ↔ (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋))
123, 11mpbid 233 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) = 𝑋)
132, 12eqtrd 2775 1 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3054  ∃!wreu 3343  c0 4268   class class class wbr 5079   Or wor 5532  crio 7319  supcsup 9350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-po 5533  df-so 5534  df-iota 6448  df-riota 7320  df-sup 9352
This theorem is referenced by:  infempty  9419
  Copyright terms: Public domain W3C validator