Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > supgtoreq | Structured version Visualization version GIF version |
Description: The supremum of a finite set is greater than or equal to all the elements of the set. (Contributed by AV, 1-Oct-2019.) |
Ref | Expression |
---|---|
supgtoreq.1 | ⊢ (𝜑 → 𝑅 Or 𝐴) |
supgtoreq.2 | ⊢ (𝜑 → 𝐵 ⊆ 𝐴) |
supgtoreq.3 | ⊢ (𝜑 → 𝐵 ∈ Fin) |
supgtoreq.4 | ⊢ (𝜑 → 𝐶 ∈ 𝐵) |
supgtoreq.5 | ⊢ (𝜑 → 𝑆 = sup(𝐵, 𝐴, 𝑅)) |
Ref | Expression |
---|---|
supgtoreq | ⊢ (𝜑 → (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supgtoreq.5 | . . . 4 ⊢ (𝜑 → 𝑆 = sup(𝐵, 𝐴, 𝑅)) | |
2 | supgtoreq.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐵) | |
3 | supgtoreq.1 | . . . . . 6 ⊢ (𝜑 → 𝑅 Or 𝐴) | |
4 | supgtoreq.2 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝐴) | |
5 | supgtoreq.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
6 | 2 | ne0d 4301 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ≠ ∅) |
7 | fisup2g 8932 | . . . . . . . 8 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴)) → ∃𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) | |
8 | 3, 5, 6, 4, 7 | syl13anc 1368 | . . . . . . 7 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) |
9 | ssrexv 4034 | . . . . . . 7 ⊢ (𝐵 ⊆ 𝐴 → (∃𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))) | |
10 | 4, 8, 9 | sylc 65 | . . . . . 6 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) |
11 | 3, 10 | supub 8923 | . . . . 5 ⊢ (𝜑 → (𝐶 ∈ 𝐵 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶)) |
12 | 2, 11 | mpd 15 | . . . 4 ⊢ (𝜑 → ¬ sup(𝐵, 𝐴, 𝑅)𝑅𝐶) |
13 | 1, 12 | eqnbrtrd 5084 | . . 3 ⊢ (𝜑 → ¬ 𝑆𝑅𝐶) |
14 | fisupcl 8933 | . . . . . . . 8 ⊢ ((𝑅 Or 𝐴 ∧ (𝐵 ∈ Fin ∧ 𝐵 ≠ ∅ ∧ 𝐵 ⊆ 𝐴)) → sup(𝐵, 𝐴, 𝑅) ∈ 𝐵) | |
15 | 3, 5, 6, 4, 14 | syl13anc 1368 | . . . . . . 7 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐵) |
16 | 4, 15 | sseldd 3968 | . . . . . 6 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) ∈ 𝐴) |
17 | 1, 16 | eqeltrd 2913 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
18 | 4, 2 | sseldd 3968 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐴) |
19 | sotric 5501 | . . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → (𝑆𝑅𝐶 ↔ ¬ (𝑆 = 𝐶 ∨ 𝐶𝑅𝑆))) | |
20 | 3, 17, 18, 19 | syl12anc 834 | . . . 4 ⊢ (𝜑 → (𝑆𝑅𝐶 ↔ ¬ (𝑆 = 𝐶 ∨ 𝐶𝑅𝑆))) |
21 | orcom 866 | . . . . . 6 ⊢ ((𝑆 = 𝐶 ∨ 𝐶𝑅𝑆) ↔ (𝐶𝑅𝑆 ∨ 𝑆 = 𝐶)) | |
22 | eqcom 2828 | . . . . . . 7 ⊢ (𝑆 = 𝐶 ↔ 𝐶 = 𝑆) | |
23 | 22 | orbi2i 909 | . . . . . 6 ⊢ ((𝐶𝑅𝑆 ∨ 𝑆 = 𝐶) ↔ (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆)) |
24 | 21, 23 | bitri 277 | . . . . 5 ⊢ ((𝑆 = 𝐶 ∨ 𝐶𝑅𝑆) ↔ (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆)) |
25 | 24 | notbii 322 | . . . 4 ⊢ (¬ (𝑆 = 𝐶 ∨ 𝐶𝑅𝑆) ↔ ¬ (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆)) |
26 | 20, 25 | syl6rbb 290 | . . 3 ⊢ (𝜑 → (¬ (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆) ↔ 𝑆𝑅𝐶)) |
27 | 13, 26 | mtbird 327 | . 2 ⊢ (𝜑 → ¬ ¬ (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆)) |
28 | 27 | notnotrd 135 | 1 ⊢ (𝜑 → (𝐶𝑅𝑆 ∨ 𝐶 = 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 ⊆ wss 3936 ∅c0 4291 class class class wbr 5066 Or wor 5473 Fincfn 8509 supcsup 8904 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-om 7581 df-1o 8102 df-er 8289 df-en 8510 df-fin 8513 df-sup 8906 |
This theorem is referenced by: infltoreq 8966 supfirege 11627 |
Copyright terms: Public domain | W3C validator |