| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fimaxg | Structured version Visualization version GIF version | ||
| Description: A finite set has a maximum under a total order. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 29-Jan-2014.) |
| Ref | Expression |
|---|---|
| fimaxg | ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑦𝑅𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fimax2g 9191 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) | |
| 2 | df-ne 2934 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
| 3 | 2 | imbi1i 349 | . . . . . . . 8 ⊢ ((𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ (¬ 𝑥 = 𝑦 → 𝑦𝑅𝑥)) |
| 4 | pm4.64 850 | . . . . . . . 8 ⊢ ((¬ 𝑥 = 𝑦 → 𝑦𝑅𝑥) ↔ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) | |
| 5 | 3, 4 | bitri 275 | . . . . . . 7 ⊢ ((𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) |
| 6 | sotric 5563 | . . . . . . . 8 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑅𝑦 ↔ ¬ (𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))) | |
| 7 | 6 | con2bid 354 | . . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ¬ 𝑥𝑅𝑦)) |
| 8 | 5, 7 | bitrid 283 | . . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ ¬ 𝑥𝑅𝑦)) |
| 9 | 8 | anassrs 467 | . . . . 5 ⊢ (((𝑅 Or 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ ¬ 𝑥𝑅𝑦)) |
| 10 | 9 | ralbidva 3158 | . . . 4 ⊢ ((𝑅 Or 𝐴 ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
| 11 | 10 | rexbidva 3159 | . . 3 ⊢ (𝑅 Or 𝐴 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
| 12 | 11 | 3ad2ant1 1134 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑦𝑅𝑥) ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
| 13 | 1, 12 | mpbird 257 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → 𝑦𝑅𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∃wrex 3061 ∅c0 4286 class class class wbr 5099 Or wor 5532 Fincfn 8888 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 ax-un 7683 |
| 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-om 7812 df-en 8889 df-fin 8892 |
| This theorem is referenced by: fisupg 9193 fimaxre 12091 |
| Copyright terms: Public domain | W3C validator |