| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fimax2g | Structured version Visualization version GIF version | ||
| Description: A finite set has a maximum under a total order. (Contributed by Jeff Madsen, 18-Jun-2010.) (Proof shortened by Mario Carneiro, 29-Jan-2014.) |
| Ref | Expression |
|---|---|
| fimax2g | ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sopo 5568 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
| 2 | cnvpo 6263 | . . . . 5 ⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴) | |
| 3 | 1, 2 | sylib 218 | . . . 4 ⊢ (𝑅 Or 𝐴 → ◡𝑅 Po 𝐴) |
| 4 | frfi 9239 | . . . 4 ⊢ ((◡𝑅 Po 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) | |
| 5 | 3, 4 | sylan 580 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) |
| 6 | 5 | 3adant3 1132 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ◡𝑅 Fr 𝐴) |
| 7 | ssid 3972 | . . . . . . 7 ⊢ 𝐴 ⊆ 𝐴 | |
| 8 | fri 5599 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ≠ ∅)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) | |
| 9 | 7, 8 | mpanr1 703 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 10 | 9 | an32s 652 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 11 | vex 3454 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
| 12 | vex 3454 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 13 | 11, 12 | brcnv 5849 | . . . . . . . 8 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
| 14 | 13 | notbii 320 | . . . . . . 7 ⊢ (¬ 𝑦◡𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦) |
| 15 | 14 | ralbii 3076 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 16 | 15 | rexbii 3077 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 17 | 10, 16 | sylib 218 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 18 | 17 | ex 412 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (◡𝑅 Fr 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
| 19 | 18 | 3adant1 1130 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (◡𝑅 Fr 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
| 20 | 6, 19 | mpd 15 | 1 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ∃wrex 3054 ⊆ wss 3917 ∅c0 4299 class class class wbr 5110 Po wpo 5547 Or wor 5548 Fr wfr 5591 ◡ccnv 5640 Fincfn 8921 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-om 7846 df-en 8922 df-fin 8925 |
| This theorem is referenced by: fimaxg 9241 ordunifi 9244 npomex 10956 n0sfincut 28253 |
| Copyright terms: Public domain | W3C validator |