Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  lejoin2 Structured version   Visualization version   GIF version

Theorem lejoin2 17617
 Description: A join's second argument is less than or equal to the join. (Contributed by NM, 16-Sep-2011.)
Hypotheses
Ref Expression
joinval2.b 𝐵 = (Base‘𝐾)
joinval2.l = (le‘𝐾)
joinval2.j = (join‘𝐾)
joinval2.k (𝜑𝐾𝑉)
joinval2.x (𝜑𝑋𝐵)
joinval2.y (𝜑𝑌𝐵)
joinlem.e (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom )
Assertion
Ref Expression
lejoin2 (𝜑𝑌 (𝑋 𝑌))

Proof of Theorem lejoin2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 joinval2.b . . 3 𝐵 = (Base‘𝐾)
2 joinval2.l . . 3 = (le‘𝐾)
3 joinval2.j . . 3 = (join‘𝐾)
4 joinval2.k . . 3 (𝜑𝐾𝑉)
5 joinval2.x . . 3 (𝜑𝑋𝐵)
6 joinval2.y . . 3 (𝜑𝑌𝐵)
7 joinlem.e . . 3 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom )
81, 2, 3, 4, 5, 6, 7joinlem 17615 . 2 (𝜑 → ((𝑋 (𝑋 𝑌) ∧ 𝑌 (𝑋 𝑌)) ∧ ∀𝑧𝐵 ((𝑋 𝑧𝑌 𝑧) → (𝑋 𝑌) 𝑧)))
98simplrd 769 1 (𝜑𝑌 (𝑋 𝑌))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ⟨cop 4531   class class class wbr 5030  dom cdm 5519  ‘cfv 6324  (class class class)co 7135  Basecbs 16477  lecple 16566  joincjn 17548 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7443 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-lub 17578  df-join 17580 This theorem is referenced by:  joinle  17618  latlej2  17665
 Copyright terms: Public domain W3C validator
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://us.metamath.org/mpeuni/lejoin2.html", "fetch_time": 1722816981000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-33/segments/1722640417235.15/warc/CC-MAIN-20240804230158-20240805020158-00671.warc.gz", "warc_record_offset": 471124041, "warc_record_length": 4806, "token_count": 1286, "char_count": 2358, "score": 3.53125, "int_score": 4, "crawl": "CC-MAIN-2024-33", "snapshot_type": "latest", "language": "en", "language_score": 0.13881561160087585, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00017-of-00064.parquet"}