| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wereu | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| wereu | ⊢ ((𝑅 We 𝐴 ∧ (𝐵 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wefr 5653 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
| 2 | fri 5621 | . . . . . 6 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑅 Fr 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 3 | 2 | exp32 426 | . . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑅 Fr 𝐴) → (𝐵 ⊆ 𝐴 → (𝐵 ≠ ∅ → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))) |
| 4 | 3 | expcom 419 | . . . 4 ⊢ (𝑅 Fr 𝐴 → (𝐵 ∈ 𝑉 → (𝐵 ⊆ 𝐴 → (𝐵 ≠ ∅ → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)))) |
| 5 | 4 | 3imp2 1368 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 6 | 1, 5 | sylan 592 | . 2 ⊢ ((𝑅 We 𝐴 ∧ (𝐵 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 7 | weso 5654 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
| 8 | soss 5591 | . . . . 5 ⊢ (𝐵 ⊆ 𝐴 → (𝑅 Or 𝐴 → 𝑅 Or 𝐵)) | |
| 9 | 7, 8 | mpan9 516 | . . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝐵 ⊆ 𝐴) → 𝑅 Or 𝐵) |
| 10 | somo 5610 | . . . 4 ⊢ (𝑅 Or 𝐵 → ∃*𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 11 | 9, 10 | syl 18 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝐵 ⊆ 𝐴) → ∃*𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 12 | 11 | 3ad2antr2 1208 | . 2 ⊢ ((𝑅 We 𝐴 ∧ (𝐵 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃*𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 13 | reu5 3373 | . 2 ⊢ (∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ∧ ∃*𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)) | |
| 14 | 6, 12, 13 | sylanbrc 595 | 1 ⊢ ((𝑅 We 𝐴 ∧ (𝐵 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2146 ≠ wne 2960 ∀wral 3081 ∃wrex 3091 ∃!wreu 3369 ∃*wrmo 3370 ⊆ wss 3906 ∅c0 4286 class class class wbr 5111 Or wor 5570 Fr wfr 5613 We wwe 5615 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 |
| This theorem is used by: htalem 9897 zorn2lem1 10495 dyadmax 25810 wevgblacfn 35654 finorwe 38087 wessf1ornlem 45963 |
| Copyright terms: Public domain | W3C validator |