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

Theorem wereu 5662
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 5656 . . 3 (𝑅 We 𝐴𝑅 Fr 𝐴)
2 fri 5626 . . . . . 6 (((𝐵𝑉𝑅 Fr 𝐴) ∧ (𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
32exp32 420 . . . . 5 ((𝐵𝑉𝑅 Fr 𝐴) → (𝐵𝐴 → (𝐵 ≠ ∅ → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)))
43expcom 413 . . . 4 (𝑅 Fr 𝐴 → (𝐵𝑉 → (𝐵𝐴 → (𝐵 ≠ ∅ → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥))))
543imp2 1346 . . 3 ((𝑅 Fr 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
61, 5sylan 579 . 2 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
7 weso 5657 . . . . 5 (𝑅 We 𝐴𝑅 Or 𝐴)
8 soss 5598 . . . . 5 (𝐵𝐴 → (𝑅 Or 𝐴𝑅 Or 𝐵))
97, 8mpan9 506 . . . 4 ((𝑅 We 𝐴𝐵𝐴) → 𝑅 Or 𝐵)
10 somo 5615 . . . 4 (𝑅 Or 𝐵 → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
119, 10syl 17 . . 3 ((𝑅 We 𝐴𝐵𝐴) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
12113ad2antr2 1186 . 2 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
13 reu5 3370 . 2 (∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ↔ (∃𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥 ∧ ∃*𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥))
146, 12, 13sylanbrc 582 1 ((𝑅 We 𝐴 ∧ (𝐵𝑉𝐵𝐴𝐵 ≠ ∅)) → ∃!𝑥𝐵𝑦𝐵 ¬ 𝑦𝑅𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1084  wcel 2098  wne 2932  wral 3053  wrex 3062  ∃!wreu 3366  ∃*wrmo 3367  wss 3940  c0 4314   class class class wbr 5138   Or wor 5577   Fr wfr 5618   We wwe 5620
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2695
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-ne 2933  df-ral 3054  df-rex 3063  df-rmo 3368  df-reu 3369  df-rab 3425  df-v 3468  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-br 5139  df-po 5578  df-so 5579  df-fr 5621  df-we 5623
This theorem is referenced by:  htalem  9886  zorn2lem1  10486  dyadmax  25437  finorwe  36719  wessf1ornlem  44335
  Copyright terms: Public domain W3C validator