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

Theorem sup0riota 9376
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 9365 . 2 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴 (∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧))))
3 ral0 4433 . . . . . 6 𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦
43biantrur 535 . . . . 5 (∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ (∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧)))
5 rex0 4295 . . . . . . 7 ¬ ∃𝑧 ∈ ∅ 𝑦𝑅𝑧
6 imnot 366 . . . . . . 7 (¬ ∃𝑧 ∈ ∅ 𝑦𝑅𝑧 → ((𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ ¬ 𝑦𝑅𝑥))
75, 6ax-mp 5 . . . . . 6 ((𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ ¬ 𝑦𝑅𝑥)
87ralbii 3086 . . . . 5 (∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧) ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥)
94, 8bitr3i 278 . . . 4 ((∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧)) ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥)
109a1i 11 . . 3 (𝑅 Or 𝐴 → ((∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧)) ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥))
1110riotabidv 7322 . 2 (𝑅 Or 𝐴 → (𝑥𝐴 (∀𝑦 ∈ ∅ ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ ∅ 𝑦𝑅𝑧))) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
122, 11eqtrd 2775 1 (𝑅 Or 𝐴 → sup(∅, 𝐴, 𝑅) = (𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396   = wceq 1547  wral 3054  wrex 3064  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-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:  sup0  9377
  Copyright terms: Public domain W3C validator