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

Theorem wereu 5658
Description: A nonempty subset of an 𝑅-well-ordered class has a unique 𝑅 -minimal element. (Contributed by NM, 18-Mar-1997.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
wereu ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑉,𝑦

Proof of Theorem wereu
StepHypRef Expression
1 wefr 5652 . . 3 (𝑅 We 𝐴𝑅 Fr 𝐴)
2 fri 5620 . . . . . 6 (((𝐵𝑉𝑅 Fr 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
32exp32 425 . . . . 5 ((𝐵𝑉𝑅 Fr 𝐴) → (𝐵𝐴 → (𝐵 ≠ ∅ → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)))
43expcom 418 . . . 4 (𝑅 Fr 𝐴 → (𝐵𝑉 → (𝐵𝐴 → (𝐵 ≠ ∅ → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥))))
543imp2 1366 . . 3 ((𝑅 Fr 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
61, 5sylan 591 . 2 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
7 weso 5653 . . . . 5 (𝑅 We 𝐴𝑅 Or 𝐴)
8 soss 5590 . . . . 5 (𝐵𝐴 → (𝑅 Or 𝐴𝑅 Or 𝐵))
97, 8mpan9 515 . . . 4 ((𝑅 We 𝐴𝐵𝐴) → 𝑅 Or 𝐵)
10 somo 5609 . . . 4 (𝑅 Or 𝐵 → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
119, 10syl 18 . . 3 ((𝑅 We 𝐴𝐵𝐴) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
12113ad2antr2 1206 . 2 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
13 reu5 3378 . 2 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ↔ (∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥))
146, 12, 13sylanbrc 594 1 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1101  wcel 2149  wne 2964  wral 3085  wrex 3095  ∃!wreu 3374  ∃*wrmo 3375  wss 3913  c0 4294   class class class wbr 5113   Or wor 5569   Fr wfr 5612   We wwe 5614
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-po 5570  df-so 5571  df-fr 5615  df-we 5617
This theorem is referenced by:  htalem  9881  zorn2lem1  10479  dyadmax  25725  wevgblacfn  35493  finorwe  37915  wessf1ornlem  45794
  Copyright terms: Public domain W3C validator