| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > tosglb | Structured version Visualization version GIF version | ||
| Description: Same theorem as toslub 33630, for infinimum. (Contributed by Thierry Arnoux, 17-Feb-2018.) (Revised by AV, 28-Sep-2020.) |
| Ref | Expression |
|---|---|
| tosglb.b | ⊢ 𝐵 = (Base‘𝐾) |
| tosglb.l | ⊢ < = (lt‘𝐾) |
| tosglb.1 | ⊢ (𝜑 → 𝐾 ∈ Toset) |
| tosglb.2 | ⊢ (𝜑 → 𝐴 ⊆ 𝐵) |
| Ref | Expression |
|---|---|
| tosglb | ⊢ (𝜑 → ((glb‘𝐾)‘𝐴) = inf(𝐴, 𝐵, < )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tosglb.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | tosglb.l | . . . . 5 ⊢ < = (lt‘𝐾) | |
| 3 | tosglb.1 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ Toset) | |
| 4 | tosglb.2 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ 𝐵) | |
| 5 | eqid 2763 | . . . . 5 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 6 | 1, 2, 3, 4, 5 | tosglblem 33631 | . . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((∀𝑏 ∈ 𝐴 𝑎(le‘𝐾)𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐(le‘𝐾)𝑏 → 𝑐(le‘𝐾)𝑎)) ↔ (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑)))) |
| 7 | 6 | riotabidva 7427 | . . 3 ⊢ (𝜑 → (℩𝑎 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑎(le‘𝐾)𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐(le‘𝐾)𝑏 → 𝑐(le‘𝐾)𝑎))) = (℩𝑎 ∈ 𝐵 (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑)))) |
| 8 | eqid 2763 | . . . 4 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 9 | biid 264 | . . . 4 ⊢ ((∀𝑏 ∈ 𝐴 𝑎(le‘𝐾)𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐(le‘𝐾)𝑏 → 𝑐(le‘𝐾)𝑎)) ↔ (∀𝑏 ∈ 𝐴 𝑎(le‘𝐾)𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐(le‘𝐾)𝑏 → 𝑐(le‘𝐾)𝑎))) | |
| 10 | 1, 5, 8, 9, 3, 4 | glbval 18591 | . . 3 ⊢ (𝜑 → ((glb‘𝐾)‘𝐴) = (℩𝑎 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑎(le‘𝐾)𝑏 ∧ ∀𝑐 ∈ 𝐵 (∀𝑏 ∈ 𝐴 𝑐(le‘𝐾)𝑏 → 𝑐(le‘𝐾)𝑎)))) |
| 11 | 1, 5, 2 | tosso 18641 | . . . . . . 7 ⊢ (𝐾 ∈ Toset → (𝐾 ∈ Toset ↔ ( < Or 𝐵 ∧ ( I ↾ 𝐵) ⊆ (le‘𝐾)))) |
| 12 | 11 | ibi 270 | . . . . . 6 ⊢ (𝐾 ∈ Toset → ( < Or 𝐵 ∧ ( I ↾ 𝐵) ⊆ (le‘𝐾))) |
| 13 | 12 | simpld 500 | . . . . 5 ⊢ (𝐾 ∈ Toset → < Or 𝐵) |
| 14 | cnvso 6315 | . . . . 5 ⊢ ( < Or 𝐵 ↔ ◡ < Or 𝐵) | |
| 15 | 13, 14 | sylib 221 | . . . 4 ⊢ (𝐾 ∈ Toset → ◡ < Or 𝐵) |
| 16 | id 23 | . . . . 5 ⊢ (◡ < Or 𝐵 → ◡ < Or 𝐵) | |
| 17 | 16 | supval2 9484 | . . . 4 ⊢ (◡ < Or 𝐵 → sup(𝐴, 𝐵, ◡ < ) = (℩𝑎 ∈ 𝐵 (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑)))) |
| 18 | 3, 15, 17 | 3syl 19 | . . 3 ⊢ (𝜑 → sup(𝐴, 𝐵, ◡ < ) = (℩𝑎 ∈ 𝐵 (∀𝑏 ∈ 𝐴 ¬ 𝑎◡ < 𝑏 ∧ ∀𝑏 ∈ 𝐵 (𝑏◡ < 𝑎 → ∃𝑑 ∈ 𝐴 𝑏◡ < 𝑑)))) |
| 19 | 7, 10, 18 | 3eqtr4d 2808 | . 2 ⊢ (𝜑 → ((glb‘𝐾)‘𝐴) = sup(𝐴, 𝐵, ◡ < )) |
| 20 | df-inf 9472 | . . . 4 ⊢ inf(𝐴, 𝐵, < ) = sup(𝐴, 𝐵, ◡ < ) | |
| 21 | 20 | eqcomi 2772 | . . 3 ⊢ sup(𝐴, 𝐵, ◡ < ) = inf(𝐴, 𝐵, < ) |
| 22 | 21 | a1i 11 | . 2 ⊢ (𝜑 → sup(𝐴, 𝐵, ◡ < ) = inf(𝐴, 𝐵, < )) |
| 23 | 19, 22 | eqtrd 2798 | 1 ⊢ (𝜑 → ((glb‘𝐾)‘𝐴) = inf(𝐴, 𝐵, < )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 class class class wbr 5108 I cid 5552 Or wor 5565 ◡ccnv 5657 ↾ cres 5660 ‘cfv 6566 ℩crio 7407 supcsup 9469 infcinf 9470 Basecbs 17431 lecple 17479 ltcplt 18532 glbcglb 18534 Tosetctos 18638 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-sup 9471 df-inf 9472 df-proset 18518 df-poset 18537 df-plt 18552 df-glb 18569 df-toset 18639 |
| This theorem is used by: xrsp0 33672 |
| Copyright terms: Public domain | W3C validator |