![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oneqmin | Structured version Visualization version GIF version |
Description: A way to show that an ordinal number equals the minimum of a nonempty collection of ordinal numbers: it must be in the collection, and it must not be larger than any member of the collection. (Contributed by NM, 14-Nov-2003.) |
Ref | Expression |
---|---|
oneqmin | ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = ∩ 𝐵 ↔ (𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | onint 7490 | . . . 4 ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → ∩ 𝐵 ∈ 𝐵) | |
2 | eleq1 2877 | . . . 4 ⊢ (𝐴 = ∩ 𝐵 → (𝐴 ∈ 𝐵 ↔ ∩ 𝐵 ∈ 𝐵)) | |
3 | 1, 2 | syl5ibrcom 250 | . . 3 ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = ∩ 𝐵 → 𝐴 ∈ 𝐵)) |
4 | eleq2 2878 | . . . . . . 7 ⊢ (𝐴 = ∩ 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ∩ 𝐵)) | |
5 | 4 | biimpd 232 | . . . . . 6 ⊢ (𝐴 = ∩ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∩ 𝐵)) |
6 | onnmin 7498 | . . . . . . . 8 ⊢ ((𝐵 ⊆ On ∧ 𝑥 ∈ 𝐵) → ¬ 𝑥 ∈ ∩ 𝐵) | |
7 | 6 | ex 416 | . . . . . . 7 ⊢ (𝐵 ⊆ On → (𝑥 ∈ 𝐵 → ¬ 𝑥 ∈ ∩ 𝐵)) |
8 | 7 | con2d 136 | . . . . . 6 ⊢ (𝐵 ⊆ On → (𝑥 ∈ ∩ 𝐵 → ¬ 𝑥 ∈ 𝐵)) |
9 | 5, 8 | syl9r 78 | . . . . 5 ⊢ (𝐵 ⊆ On → (𝐴 = ∩ 𝐵 → (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵))) |
10 | 9 | ralrimdv 3153 | . . . 4 ⊢ (𝐵 ⊆ On → (𝐴 = ∩ 𝐵 → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)) |
11 | 10 | adantr 484 | . . 3 ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = ∩ 𝐵 → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵)) |
12 | 3, 11 | jcad 516 | . 2 ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = ∩ 𝐵 → (𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵))) |
13 | oneqmini 6210 | . . 3 ⊢ (𝐵 ⊆ On → ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) → 𝐴 = ∩ 𝐵)) | |
14 | 13 | adantr 484 | . 2 ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → ((𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) → 𝐴 = ∩ 𝐵)) |
15 | 12, 14 | impbid 215 | 1 ⊢ ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = ∩ 𝐵 ↔ (𝐴 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ⊆ wss 3881 ∅c0 4243 ∩ cint 4838 Oncon0 6159 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-br 5031 df-opab 5093 df-tr 5137 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-ord 6162 df-on 6163 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |