Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > joineu | Structured version Visualization version GIF version |
Description: Uniqueness of join of elements in the domain. (Contributed by NM, 12-Sep-2018.) |
Ref | Expression |
---|---|
joinval2.b | ⊢ 𝐵 = (Base‘𝐾) |
joinval2.l | ⊢ ≤ = (le‘𝐾) |
joinval2.j | ⊢ ∨ = (join‘𝐾) |
joinval2.k | ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
joinval2.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
joinval2.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
joinlem.e | ⊢ (𝜑 → 〈𝑋, 𝑌〉 ∈ dom ∨ ) |
Ref | Expression |
---|---|
joineu | ⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | joinlem.e | . 2 ⊢ (𝜑 → 〈𝑋, 𝑌〉 ∈ dom ∨ ) | |
2 | eqid 2824 | . . . 4 ⊢ (lub‘𝐾) = (lub‘𝐾) | |
3 | joinval2.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
4 | joinval2.k | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) | |
5 | joinval2.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
6 | joinval2.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
7 | 2, 3, 4, 5, 6 | joindef 17617 | . . 3 ⊢ (𝜑 → (〈𝑋, 𝑌〉 ∈ dom ∨ ↔ {𝑋, 𝑌} ∈ dom (lub‘𝐾))) |
8 | joinval2.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
9 | joinval2.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
10 | biid 263 | . . . . . 6 ⊢ ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) | |
11 | 4 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (lub‘𝐾)) → 𝐾 ∈ 𝑉) |
12 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (lub‘𝐾)) → {𝑋, 𝑌} ∈ dom (lub‘𝐾)) | |
13 | 8, 9, 2, 10, 11, 12 | lubeu 17596 | . . . . 5 ⊢ ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (lub‘𝐾)) → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) |
14 | 13 | ex 415 | . . . 4 ⊢ (𝜑 → ({𝑋, 𝑌} ∈ dom (lub‘𝐾) → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) |
15 | 8, 9, 3, 4, 5, 6 | joinval2lem 17621 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
16 | 5, 6, 15 | syl2anc 586 | . . . . 5 ⊢ (𝜑 → ((∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
17 | 16 | reubidv 3392 | . . . 4 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
18 | 14, 17 | sylibd 241 | . . 3 ⊢ (𝜑 → ({𝑋, 𝑌} ∈ dom (lub‘𝐾) → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
19 | 7, 18 | sylbid 242 | . 2 ⊢ (𝜑 → (〈𝑋, 𝑌〉 ∈ dom ∨ → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧)))) |
20 | 1, 19 | mpd 15 | 1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 ((𝑋 ≤ 𝑥 ∧ 𝑌 ≤ 𝑥) ∧ ∀𝑧 ∈ 𝐵 ((𝑋 ≤ 𝑧 ∧ 𝑌 ≤ 𝑧) → 𝑥 ≤ 𝑧))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ∃!wreu 3143 {cpr 4572 〈cop 4576 class class class wbr 5069 dom cdm 5558 ‘cfv 6358 Basecbs 16486 lecple 16575 lubclub 17555 joincjn 17557 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-oprab 7163 df-lub 17587 df-join 17589 |
This theorem is referenced by: joinlem 17624 |
Copyright terms: Public domain | W3C validator |