| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lublecl | Structured version Visualization version GIF version | ||
| Description: The set of all elements less than a given element has an LUB. (Contributed by NM, 8-Sep-2018.) |
| Ref | Expression |
|---|---|
| lublecl.b | ⊢ 𝐵 = (Base‘𝐾) |
| lublecl.l | ⊢ ≤ = (le‘𝐾) |
| lublecl.u | ⊢ 𝑈 = (lub‘𝐾) |
| lublecl.k | ⊢ (𝜑 → 𝐾 ∈ Poset) |
| lublecl.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| lublecl | ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ∈ dom 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrab2 4035 | . . 3 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵 | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵) |
| 3 | lublecl.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 4 | lublecl.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | lublecl.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 6 | lublecl.u | . . . . 5 ⊢ 𝑈 = (lub‘𝐾) | |
| 7 | lublecl.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ Poset) | |
| 8 | 4, 5, 6, 7, 3 | lublecllem 18441 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋)) |
| 9 | 8 | ralrimiva 3159 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋)) |
| 10 | reu6i 3693 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋)) → ∃!𝑥 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤))) | |
| 11 | 3, 9, 10 | syl2anc 596 | . 2 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤))) |
| 12 | biid 264 | . . 3 ⊢ ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤))) | |
| 13 | 4, 5, 6, 12, 7 | lubeldm 18434 | . 2 ⊢ (𝜑 → ({𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ∈ dom 𝑈 ↔ ({𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤))))) |
| 14 | 2, 11, 13 | mpbir2and 726 | 1 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ∈ dom 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∃!wreu 3369 {crab 3418 ⊆ wss 3906 class class class wbr 5111 dom cdm 5663 ‘cfv 6541 Basecbs 17296 lecple 17344 Posetcpo 18390 lubclub 18392 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7377 df-proset 18377 df-poset 18396 df-lub 18427 |
| This theorem is used by: lubprlem 49817 |
| Copyright terms: Public domain | W3C validator |