| 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 5559 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
| 2 | cnvpo 6253 | . . . . 5 ⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴) | |
| 3 | 1, 2 | sylib 218 | . . . 4 ⊢ (𝑅 Or 𝐴 → ◡𝑅 Po 𝐴) |
| 4 | frfi 9197 | . . . 4 ⊢ ((◡𝑅 Po 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) | |
| 5 | 3, 4 | sylan 581 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) |
| 6 | 5 | 3adant3 1133 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ◡𝑅 Fr 𝐴) |
| 7 | ssid 3958 | . . . . . . 7 ⊢ 𝐴 ⊆ 𝐴 | |
| 8 | fri 5590 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ≠ ∅)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) | |
| 9 | 7, 8 | mpanr1 704 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 10 | 9 | an32s 653 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
| 11 | vex 3446 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
| 12 | vex 3446 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 13 | 11, 12 | brcnv 5839 | . . . . . . . 8 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
| 14 | 13 | notbii 320 | . . . . . . 7 ⊢ (¬ 𝑦◡𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦) |
| 15 | 14 | ralbii 3084 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 16 | 15 | rexbii 3085 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 17 | 10, 16 | sylib 218 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
| 18 | 17 | ex 412 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (◡𝑅 Fr 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
| 19 | 18 | 3adant1 1131 | . 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 1087 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∃wrex 3062 ⊆ wss 3903 ∅c0 4287 class class class wbr 5100 Po wpo 5538 Or wor 5539 Fr wfr 5582 ◡ccnv 5631 Fincfn 8895 |
| 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 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| 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 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-om 7819 df-en 8896 df-fin 8899 |
| This theorem is referenced by: fimaxg 9199 ordunifi 9202 npomex 10919 n0fincut 28363 bdayfinbndlem1 28475 |
| Copyright terms: Public domain | W3C validator |