![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tz6.26i | Structured version Visualization version GIF version |
Description: All nonempty subclasses of a class having a well-ordered set-like relation 𝑅 have 𝑅-minimal elements. Proposition 6.26 of [TakeutiZaring] p. 31. (Contributed by Scott Fenton, 14-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) |
Ref | Expression |
---|---|
tz6.26i.1 | ⊢ 𝑅 We 𝐴 |
tz6.26i.2 | ⊢ 𝑅 Se 𝐴 |
Ref | Expression |
---|---|
tz6.26i | ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑦 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tz6.26i.1 | . 2 ⊢ 𝑅 We 𝐴 | |
2 | tz6.26i.2 | . 2 ⊢ 𝑅 Se 𝐴 | |
3 | tz6.26 6302 | . 2 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑦 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅) | |
4 | 1, 2, 3 | mpanl12 701 | 1 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑦 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑦) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ≠ wne 2940 ∃wrex 3070 ⊆ wss 3911 ∅c0 4283 Se wse 5587 We wwe 5588 Predcpred 6253 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5257 ax-nul 5264 ax-pr 5385 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3407 df-v 3446 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-br 5107 df-opab 5169 df-po 5546 df-so 5547 df-fr 5589 df-se 5590 df-we 5591 df-xp 5640 df-cnv 5642 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6254 |
This theorem is referenced by: wfrlem16OLD 8271 |
Copyright terms: Public domain | W3C validator |