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

Theorem wereu 5650
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 5644 . . 3 (𝑅 We 𝐴𝑅 Fr 𝐴)
2 fri 5611 . . . . . 6 (((𝐵𝑉𝑅 Fr 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
32exp32 420 . . . . 5 ((𝐵𝑉𝑅 Fr 𝐴) → (𝐵𝐴 → (𝐵 ≠ ∅ → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)))
43expcom 413 . . . 4 (𝑅 Fr 𝐴 → (𝐵𝑉 → (𝐵𝐴 → (𝐵 ≠ ∅ → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥))))
543imp2 1350 . . 3 ((𝑅 Fr 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
61, 5sylan 580 . 2 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
7 weso 5645 . . . . 5 (𝑅 We 𝐴𝑅 Or 𝐴)
8 soss 5581 . . . . 5 (𝐵𝐴 → (𝑅 Or 𝐴𝑅 Or 𝐵))
97, 8mpan9 506 . . . 4 ((𝑅 We 𝐴𝐵𝐴) → 𝑅 Or 𝐵)
10 somo 5600 . . . 4 (𝑅 Or 𝐵 → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
119, 10syl 17 . . 3 ((𝑅 We 𝐴𝐵𝐴) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
12113ad2antr2 1190 . 2 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
13 reu5 3361 . 2 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ↔ (∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥))
146, 12, 13sylanbrc 583 1 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1086  wcel 2108  wne 2932  wral 3051  wrex 3060  ∃!wreu 3357  ∃*wrmo 3358  wss 3926  c0 4308   class class class wbr 5119   Or wor 5560   Fr wfr 5603   We wwe 5605
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-br 5120  df-po 5561  df-so 5562  df-fr 5606  df-we 5608
This theorem is referenced by:  htalem  9910  zorn2lem1  10510  dyadmax  25551  wevgblacfn  35131  finorwe  37400  wessf1ornlem  45209
  Copyright terms: Public domain W3C validator