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 5522 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
2 | cnvpo 6190 | . . . . 5 ⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴) | |
3 | 1, 2 | sylib 217 | . . . 4 ⊢ (𝑅 Or 𝐴 → ◡𝑅 Po 𝐴) |
4 | frfi 9059 | . . . 4 ⊢ ((◡𝑅 Po 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) | |
5 | 3, 4 | sylan 580 | . . 3 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin) → ◡𝑅 Fr 𝐴) |
6 | 5 | 3adant3 1131 | . 2 ⊢ ((𝑅 Or 𝐴 ∧ 𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → ◡𝑅 Fr 𝐴) |
7 | ssid 3943 | . . . . . . 7 ⊢ 𝐴 ⊆ 𝐴 | |
8 | fri 5549 | . . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ≠ ∅)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) | |
9 | 7, 8 | mpanr1 700 | . . . . . 6 ⊢ (((𝐴 ∈ Fin ∧ ◡𝑅 Fr 𝐴) ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
10 | 9 | an32s 649 | . . . . 5 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥) |
11 | vex 3436 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
12 | vex 3436 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
13 | 11, 12 | brcnv 5791 | . . . . . . . 8 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦) |
14 | 13 | notbii 320 | . . . . . . 7 ⊢ (¬ 𝑦◡𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦) |
15 | 14 | ralbii 3092 | . . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
16 | 15 | rexbii 3181 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑦◡𝑅𝑥 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
17 | 10, 16 | sylib 217 | . . . 4 ⊢ (((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) ∧ ◡𝑅 Fr 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦) |
18 | 17 | ex 413 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐴 ≠ ∅) → (◡𝑅 Fr 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥𝑅𝑦)) |
19 | 18 | 3adant1 1129 | . 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 396 ∧ w3a 1086 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 ⊆ wss 3887 ∅c0 4256 class class class wbr 5074 Po wpo 5501 Or wor 5502 Fr wfr 5541 ◡ccnv 5588 Fincfn 8733 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-om 7713 df-en 8734 df-fin 8737 |
This theorem is referenced by: fimaxg 9061 ordunifi 9064 npomex 10752 |
Copyright terms: Public domain | W3C validator |