| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tz7.5 | Structured version Visualization version GIF version | ||
| Description: A nonempty subclass of an ordinal class has a minimal element. Proposition 7.5 of [TakeutiZaring] p. 36. (Contributed by NM, 18-Feb-2004.) (Revised by David Abernethy, 16-Mar-2011.) |
| Ref | Expression |
|---|---|
| tz7.5 | ⊢ ((Ord 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordwe 6364 | . 2 ⊢ (Ord 𝐴 → E We 𝐴) | |
| 2 | wefrc 5641 | . 2 ⊢ (( E We 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅) | |
| 3 | 1, 2 | syl3an1 1181 | 1 ⊢ ((Ord 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ≠ wne 2955 ∃wrex 3086 ∩ cin 3897 ⊆ wss 3898 ∅c0 4278 E cep 5546 We wwe 5599 Ord word 6350 |
| 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 2147 ax-9 2155 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| 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-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-ord 6354 |
| This theorem is used by: tz7.7 6377 onint 7787 tfi 7847 peano5 7888 fin23lem26 10374 |
| Copyright terms: Public domain | W3C validator |