| 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 5558 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
| 2 | cnvpo 6248 | . . . . 5 ⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴) | |
| 3 | 1, 2 | sylib 218 | . . . 4 ⊢ (𝑅 Or 𝐴 → ◡𝑅 Po 𝐴) |
| 4 | frfi 9208 | . . . 4 ⊢ ((◡𝑅 Po 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) | |
| 5 | 3, 4 | sylan 580 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) |
| 6 | 5 | 3adant3 1132 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ◡𝑅 Fr 𝐴) |
| 7 | ssid 3966 | . . . . . . 7 ⊢ 𝐴 ⊆ 𝐴 | |
| 8 | fri 5589 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ≠ ∅)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) | |
| 9 | 7, 8 | mpanr1 703 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 10 | 9 | an32s 652 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 11 | vex 3448 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
| 12 | vex 3448 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 13 | 11, 12 | brcnv 5836 | . . . . . . . 8 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
| 14 | 13 | notbii 320 | . . . . . . 7 ⊢ (¬ 𝑦◡𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦) |
| 15 | 14 | ralbii 3075 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 16 | 15 | rexbii 3076 | . . . . 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 2925 ∀wral 3044 ∃wrex 3053 ⊆ wss 3911 ∅c0 4292 class class class wbr 5102 Po wpo 5537 Or wor 5538 Fr wfr 5581 ◡ccnv 5630 Fincfn 8895 |
| 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 2701 ax-sep 5246 ax-nul 5256 ax-pr 5382 ax-un 7691 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-om 7823 df-en 8896 df-fin 8899 |
| This theorem is referenced by: fimaxg 9210 ordunifi 9213 npomex 10925 n0sfincut 28222 |
| Copyright terms: Public domain | W3C validator |