Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > joinval2 | Structured version Visualization version GIF version |
Description: Value of join for a poset with LUB expanded. (Contributed by NM, 16-Sep-2011.) (Revised by NM, 11-Sep-2018.) |
Ref | Expression |
---|---|
joinval2.b | ⊢ 𝐵 = (Base‘𝐾) |
joinval2.l | ⊢ ≤ = (le‘𝐾) |
joinval2.j | ⊢ ∨ = (join‘𝐾) |
joinval2.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
joinval2.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
joinval2.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
Ref | Expression |
---|---|
joinval2 | ⊢ (𝜑 → (𝑋 ∨ 𝑌) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2622 | . . 3 ⊢ (lub‘𝐾) = (lub‘𝐾) | |
2 | joinval2.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
3 | joinval2.k | . . 3 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
4 | joinval2.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
5 | joinval2.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
6 | 1, 2, 3, 4, 5 | joinval 17005 | . 2 ⊢ (𝜑 → (𝑋 ∨ 𝑌) = ((lub‘𝐾)‘{𝑋, 𝑌})) |
7 | joinval2.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
8 | joinval2.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
9 | biid 251 | . . 3 ⊢ ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) | |
10 | prssi 4353 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) | |
11 | 4, 5, 10 | syl2anc 693 | . . 3 ⊢ (𝜑 → {𝑋, 𝑌} ⊆ 𝐵) |
12 | 7, 8, 1, 9, 3, 11 | lubval 16984 | . 2 ⊢ (𝜑 → ((lub‘𝐾)‘{𝑋, 𝑌}) = (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) |
13 | 7, 8, 2, 3, 4, 5 | joinval2lem 17008 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
14 | 13 | riotabidv 6613 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
15 | 4, 5, 14 | syl2anc 693 | . 2 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
16 | 6, 12, 15 | 3eqtrd 2660 | 1 ⊢ (𝜑 → (𝑋 ∨ 𝑌) = (℩𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ⊆ wss 3574 {cpr 4179 class class class wbr 4653 ‘cfv 5888 ℩crio 6610 (class class class)co 6650 Basecbs 15857 lecple 15948 lubclub 16942 joincjn 16944 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-lub 16974 df-join 16976 |
This theorem is referenced by: joinlem 17011 |
Copyright terms: Public domain | W3C validator |