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

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

Proof of Theorem infempty
StepHypRef Expression
1 df-inf 9346 . 2 inf(∅, 𝐴, 𝑅) = sup(∅, 𝐴, 𝑅)
2 cnvso 6246 . . 3 (𝑅 Or 𝐴𝑅 Or 𝐴)
3 brcnvg 5828 . . . . . . . 8 ((𝑦𝐴𝑋𝐴) → (𝑦𝑅𝑋𝑋𝑅𝑦))
43ancoms 458 . . . . . . 7 ((𝑋𝐴𝑦𝐴) → (𝑦𝑅𝑋𝑋𝑅𝑦))
54bicomd 223 . . . . . 6 ((𝑋𝐴𝑦𝐴) → (𝑋𝑅𝑦𝑦𝑅𝑋))
65notbid 318 . . . . 5 ((𝑋𝐴𝑦𝐴) → (¬ 𝑋𝑅𝑦 ↔ ¬ 𝑦𝑅𝑋))
76ralbidva 3157 . . . 4 (𝑋𝐴 → (∀𝑦𝐴 ¬ 𝑋𝑅𝑦 ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋))
87pm5.32i 574 . . 3 ((𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑋𝑅𝑦) ↔ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋))
9 brcnvg 5828 . . . . . . . 8 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑥𝑅𝑦))
109ancoms 458 . . . . . . 7 ((𝑥𝐴𝑦𝐴) → (𝑦𝑅𝑥𝑥𝑅𝑦))
1110bicomd 223 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑦𝑅𝑥))
1211notbid 318 . . . . 5 ((𝑥𝐴𝑦𝐴) → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑦𝑅𝑥))
1312ralbidva 3157 . . . 4 (𝑥𝐴 → (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦𝐴 ¬ 𝑦𝑅𝑥))
1413reubiia 3357 . . 3 (∃!𝑥𝐴𝑦𝐴 ¬ 𝑥𝑅𝑦 ↔ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥)
15 sup0 9370 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑦𝑅𝑋) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑦𝑅𝑥) → sup(∅, 𝐴, 𝑅) = 𝑋)
162, 8, 14, 15syl3anb 1161 . 2 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑋𝑅𝑦) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑥𝑅𝑦) → sup(∅, 𝐴, 𝑅) = 𝑋)
171, 16eqtrid 2783 1 ((𝑅 Or 𝐴 ∧ (𝑋𝐴 ∧ ∀𝑦𝐴 ¬ 𝑋𝑅𝑦) ∧ ∃!𝑥𝐴𝑦𝐴 ¬ 𝑥𝑅𝑦) → inf(∅, 𝐴, 𝑅) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3051  ∃!wreu 3348  c0 4285   class class class wbr 5098   Or wor 5531  ccnv 5623  supcsup 9343  infcinf 9344
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 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-po 5532  df-so 5533  df-cnv 5632  df-iota 6448  df-riota 7315  df-sup 9345  df-inf 9346
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator