![]() |
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 5081 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
2 | cnvpo 5711 | . . . . 5 ⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴) | |
3 | 1, 2 | sylib 208 | . . . 4 ⊢ (𝑅 Or 𝐴 → ◡𝑅 Po 𝐴) |
4 | frfi 8246 | . . . 4 ⊢ ((◡𝑅 Po 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) | |
5 | 3, 4 | sylan 487 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) |
6 | 5 | 3adant3 1101 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ◡𝑅 Fr 𝐴) |
7 | ssid 3657 | . . . . . . 7 ⊢ 𝐴 ⊆ 𝐴 | |
8 | fri 5105 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ≠ ∅)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) | |
9 | 7, 8 | mpanr1 719 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
10 | 9 | an32s 863 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
11 | vex 3234 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
12 | vex 3234 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
13 | 11, 12 | brcnv 5337 | . . . . . . . 8 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
14 | 13 | notbii 309 | . . . . . . 7 ⊢ (¬ 𝑦◡𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦) |
15 | 14 | ralbii 3009 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
16 | 15 | rexbii 3070 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
17 | 10, 16 | sylib 208 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
18 | 17 | ex 449 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (◡𝑅 Fr 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
19 | 18 | 3adant1 1099 | . 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 383 ∧ w3a 1054 ∈ wcel 2030 ≠ wne 2823 ∀wral 2941 ∃wrex 2942 ⊆ wss 3607 ∅c0 3948 class class class wbr 4685 Po wpo 5062 Or wor 5063 Fr wfr 5099 ◡ccnv 5142 Fincfn 7997 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-sbc 3469 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-br 4686 df-opab 4746 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-om 7108 df-1o 7605 df-er 7787 df-en 7998 df-fin 8001 |
This theorem is referenced by: fimaxg 8248 ordunifi 8251 npomex 9856 |
Copyright terms: Public domain | W3C validator |