Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  hlatexch3N Structured version   Visualization version   GIF version

Theorem hlatexch3N 40538
Description: Rearrange join of atoms in an equality. (Contributed by NM, 29-Jul-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
hlatexch4.j ∨ = (join‘𝐾)
hlatexch4.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
hlatexch3N ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑅))

Proof of Theorem hlatexch3N
StepHypRef Expression
1 simp1 1154 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝐾 ∈ HL)
2 simp21 1225 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑃 ∈ 𝐴)
3 simp22 1226 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑄 ∈ 𝐴)
4 eqid 2760 . . . . . 6 (le‘𝐾) = (le‘𝐾)
5 hlatexch4.j . . . . . 6 ∨ = (join‘𝐾)
6 hlatexch4.a . . . . . 6 𝐴 = (Atoms‘𝐾)
74, 5, 6hlatlej2 40434 . . . . 5 ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 𝑄(le‘𝐾)(𝑃 ∨ 𝑄))
81, 2, 3, 7syl3anc 1398 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑄(le‘𝐾)(𝑃 ∨ 𝑄))
9 simp23 1227 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑅 ∈ 𝐴)
104, 5, 6hlatlej2 40434 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → 𝑅(le‘𝐾)(𝑃 ∨ 𝑅))
111, 2, 9, 10syl3anc 1398 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑅(le‘𝐾)(𝑃 ∨ 𝑅))
12 simp3r 1221 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))
1311, 12breqtrrd 5132 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑅(le‘𝐾)(𝑃 ∨ 𝑄))
14 hllat 40421 . . . . . 6 (𝐾 ∈ HL → 𝐾 ∈ Lat)
15143ad2ant1 1151 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝐾 ∈ Lat)
16 eqid 2760 . . . . . . 7 (Base‘𝐾) = (Base‘𝐾)
1716, 6atbase 40347 . . . . . 6 (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
183, 17syl 18 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑄 ∈ (Base‘𝐾))
1916, 6atbase 40347 . . . . . 6 (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾))
209, 19syl 18 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑅 ∈ (Base‘𝐾))
2116, 5, 6hlatjcl 40425 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
221, 2, 3, 21syl3anc 1398 . . . . 5 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
2316, 4, 5latjle12 18624 . . . . 5 ((𝐾 ∈ Lat ∧ (𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))) → ((𝑄(le‘𝐾)(𝑃 ∨ 𝑄) ∧ 𝑅(le‘𝐾)(𝑃 ∨ 𝑄)) ↔ (𝑄 ∨ 𝑅)(le‘𝐾)(𝑃 ∨ 𝑄)))
2415, 18, 20, 22, 23syl13anc 1399 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → ((𝑄(le‘𝐾)(𝑃 ∨ 𝑄) ∧ 𝑅(le‘𝐾)(𝑃 ∨ 𝑄)) ↔ (𝑄 ∨ 𝑅)(le‘𝐾)(𝑃 ∨ 𝑄)))
258, 13, 24mpbi2and 725 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → (𝑄 ∨ 𝑅)(le‘𝐾)(𝑃 ∨ 𝑄))
26 simp3l 1220 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → 𝑄 ≠ 𝑅)
274, 5, 6ps-1 40535 . . . 4 ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑄 ≠ 𝑅) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑄 ∨ 𝑅)(le‘𝐾)(𝑃 ∨ 𝑄) ↔ (𝑄 ∨ 𝑅) = (𝑃 ∨ 𝑄)))
281, 3, 9, 26, 2, 3, 27syl132anc 1415 . . 3 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → ((𝑄 ∨ 𝑅)(le‘𝐾)(𝑃 ∨ 𝑄) ↔ (𝑄 ∨ 𝑅) = (𝑃 ∨ 𝑄)))
2925, 28mpbid 235 . 2 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → (𝑄 ∨ 𝑅) = (𝑃 ∨ 𝑄))
3029eqcomd 2766 1 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  joincjn 18485  Latclat 18605  Atomscatm 40321  HLchlt 40408
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-proset 18468  df-poset 18487  df-plt 18502  df-lub 18518  df-glb 18519  df-join 18520  df-meet 18521  df-p0 18597  df-lat 18606  df-covers 40324  df-ats 40325  df-atl 40356  df-cvlat 40380  df-hlat 40409
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator