| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onnmin | Structured version Visualization version GIF version | ||
| Description: No member of a set of ordinal numbers belongs to its minimum. (Contributed by NM, 2-Feb-1997.) |
| Ref | Expression |
|---|---|
| onnmin | ⊢ ((𝐴 ⊆ On ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵 ∈ ∩ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intss1 4920 | . . 3 ⊢ (𝐵 ∈ 𝐴 → ∩ 𝐴 ⊆ 𝐵) | |
| 2 | 1 | adantl 481 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐵 ∈ 𝐴) → ∩ 𝐴 ⊆ 𝐵) |
| 3 | ne0i 4295 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → 𝐴 ≠ ∅) | |
| 4 | oninton 7750 | . . . 4 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∩ 𝐴 ∈ On) | |
| 5 | 3, 4 | sylan2 594 | . . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐵 ∈ 𝐴) → ∩ 𝐴 ∈ On) |
| 6 | ssel2 3930 | . . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ On) | |
| 7 | ontri1 6359 | . . 3 ⊢ ((∩ 𝐴 ∈ On ∧ 𝐵 ∈ On) → (∩ 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ ∩ 𝐴)) | |
| 8 | 5, 6, 7 | syl2anc 585 | . 2 ⊢ ((𝐴 ⊆ On ∧ 𝐵 ∈ 𝐴) → (∩ 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ ∩ 𝐴)) |
| 9 | 2, 8 | mpbid 232 | 1 ⊢ ((𝐴 ⊆ On ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵 ∈ ∩ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ≠ wne 2933 ⊆ wss 3903 ∅c0 4287 ∩ cint 4904 Oncon0 6325 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-ord 6328 df-on 6329 |
| This theorem is referenced by: onnminsb 7754 oneqmin 7755 onmindif2 7762 cardmin2 9923 ackbij1lem18 10158 cofsmo 10191 fin23lem26 10247 lrrecfr 27951 regsfromunir1 36689 |
| Copyright terms: Public domain | W3C validator |