![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fiming | Structured version Visualization version GIF version |
Description: A finite set has a minimum under a total order. (Contributed by AV, 6-Oct-2020.) |
Ref | Expression |
---|---|
fiming | ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑥𝑅𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fimin2g 8571 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥) | |
2 | nesym 2989 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑦 = 𝑥) | |
3 | 2 | imbi1i 338 | . . . . . . . 8 ⊢ ((𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ (¬ 𝑦 = 𝑥 → 𝑥𝑅𝑦)) |
4 | pm4.64 386 | . . . . . . . 8 ⊢ ((¬ 𝑦 = 𝑥 → 𝑥𝑅𝑦) ↔ (𝑦 = 𝑥 ∨ 𝑥𝑅𝑦)) | |
5 | 3, 4 | bitri 264 | . . . . . . 7 ⊢ ((𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ (𝑦 = 𝑥 ∨ 𝑥𝑅𝑦)) |
6 | sotric 5214 | . . . . . . . . 9 ⊢ ((𝑅 Or 𝐴 ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → (𝑦𝑅𝑥 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑥𝑅𝑦))) | |
7 | 6 | ancom2s 879 | . . . . . . . 8 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑦𝑅𝑥 ↔ ¬ (𝑦 = 𝑥 ∨ 𝑥𝑅𝑦))) |
8 | 7 | con2bid 343 | . . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑦 = 𝑥 ∨ 𝑥𝑅𝑦) ↔ ¬ 𝑦𝑅𝑥)) |
9 | 5, 8 | syl5bb 272 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ ¬ 𝑦𝑅𝑥)) |
10 | 9 | anassrs 683 | . . . . 5 ⊢ (((𝑅 Or 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ ¬ 𝑦𝑅𝑥)) |
11 | 10 | ralbidva 3124 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)) |
12 | 11 | rexbidva 3188 | . . 3 ⊢ (𝑅 Or 𝐴 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)) |
13 | 12 | 3ad2ant1 1128 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑥𝑅𝑦) ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦𝑅𝑥)) |
14 | 1, 13 | mpbird 247 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑥𝑅𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∨ wo 382 ∧ wa 383 ∧ w3a 1072 ∈ wcel 2140 ≠ wne 2933 ∀wral 3051 ∃wrex 3052 ∅c0 4059 class class class wbr 4805 Or wor 5187 Fincfn 8124 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1989 ax-6 2055 ax-7 2091 ax-8 2142 ax-9 2149 ax-10 2169 ax-11 2184 ax-12 2197 ax-13 2392 ax-ext 2741 ax-sep 4934 ax-nul 4942 ax-pow 4993 ax-pr 5056 ax-un 7116 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2048 df-eu 2612 df-mo 2613 df-clab 2748 df-cleq 2754 df-clel 2757 df-nfc 2892 df-ne 2934 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3343 df-sbc 3578 df-dif 3719 df-un 3721 df-in 3723 df-ss 3730 df-pss 3732 df-nul 4060 df-if 4232 df-pw 4305 df-sn 4323 df-pr 4325 df-tp 4327 df-op 4329 df-uni 4590 df-br 4806 df-opab 4866 df-tr 4906 df-id 5175 df-eprel 5180 df-po 5188 df-so 5189 df-fr 5226 df-we 5228 df-xp 5273 df-rel 5274 df-cnv 5275 df-co 5276 df-dm 5277 df-rn 5278 df-res 5279 df-ima 5280 df-ord 5888 df-on 5889 df-lim 5890 df-suc 5891 df-iota 6013 df-fun 6052 df-fn 6053 df-f 6054 df-f1 6055 df-fo 6056 df-f1o 6057 df-fv 6058 df-om 7233 df-1o 7731 df-er 7914 df-en 8125 df-fin 8128 |
This theorem is referenced by: fiinfg 8573 |
Copyright terms: Public domain | W3C validator |