| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tz6.26 | Structured version Visualization version GIF version | ||
| Description: All nonempty subclasses of a class having a well-ordered set-like relation have minimal elements for that relation. Proposition 6.26 of [TakeutiZaring] p. 31. (Contributed by Scott Fenton, 29-Jan-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) (Proof shortened by Scott Fenton, 17-Nov-2024.) |
| Ref | Expression |
|---|---|
| tz6.26 | ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑦 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wefr 5653 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Fr 𝐴) |
| 3 | weso 5654 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
| 4 | sopo 5590 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
| 5 | 3, 4 | syl 18 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Po 𝐴) |
| 6 | 5 | adantr 486 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Po 𝐴) |
| 7 | simpr 490 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
| 8 | 2, 6, 7 | 3jca 1146 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴)) |
| 9 | frpomin2 6347 | . 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑦 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅) | |
| 10 | 8, 9 | sylan 592 | 1 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑦 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ≠ wne 2960 ∃wrex 3091 ⊆ wss 3906 ∅c0 4286 Po wpo 5569 Or wor 5570 Fr wfr 5613 Se wse 5614 We wwe 5615 Predcpred 6306 |
| 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-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 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-opab 5176 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6307 |
| This theorem is used by: tz6.26i 6354 wzel 36356 wsuclem 36357 |
| Copyright terms: Public domain | W3C validator |