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

Theorem sup0riota 9154
Description: The supremum of an empty set is the smallest element of the base set. (Contributed by AV, 4-Sep-2020.)
Assertion
Ref Expression
sup0riota (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦

Proof of Theorem sup0riota
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 id 22 . . 3 (𝑅 Or 𝐴𝑅 Or 𝐴)
21supval2 9144 . 2 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴 (∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧))))
3 ral0 4440 . . . . . 6 𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦
43biantrur 530 . . . . 5 (∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ (∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧)))
5 rex0 4288 . . . . . . 7 ¬ ∃𝑧 ∈ ∅ 𝑦𝑅𝑧
6 imnot 365 . . . . . . 7 (¬ ∃𝑧 ∈ ∅ 𝑦𝑅𝑧 → ((𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ ¬ 𝑦𝑅𝑥))
75, 6ax-mp 5 . . . . . 6 ((𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ ¬ 𝑦𝑅𝑥)
87ralbii 3090 . . . . 5 (∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥)
94, 8bitr3i 276 . . . 4 ((∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧)) ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥)
109a1i 11 . . 3 (𝑅 Or 𝐴 → ((∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧)) ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥))
1110riotabidv 7214 . 2 (𝑅 Or 𝐴 → (𝑥𝐴 (∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧))) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
122, 11eqtrd 2778 1 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1539  wral 3063  wrex 3064  c0 4253   class class class wbr 5070   Or wor 5493  crio 7211  supcsup 9129
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-po 5494  df-so 5495  df-iota 6376  df-riota 7212  df-sup 9131
This theorem is referenced by:  sup0  9155
  Copyright terms: Public domain W3C validator