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

Theorem cvlsupr3 33649
Description: Two equivalent ways of expressing that 𝑅 is a superposition of 𝑃 and 𝑄, which can replace the superposition part of ishlat1 33657, (𝑥𝑦 → ∃𝑧𝐴(𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦)) ), with the simpler 𝑧𝐴(𝑥 𝑧) = (𝑦 𝑧) as shown in ishlat3N 33659. (Contributed by NM, 5-Nov-2012.)
Hypotheses
Ref Expression
cvlsupr2.a 𝐴 = (Atoms‘𝐾)
cvlsupr2.l = (le‘𝐾)
cvlsupr2.j = (join‘𝐾)
Assertion
Ref Expression
cvlsupr3 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → ((𝑃 𝑅) = (𝑄 𝑅) ↔ (𝑃𝑄 → (𝑅𝑃𝑅𝑄𝑅 (𝑃 𝑄)))))

Proof of Theorem cvlsupr3
StepHypRef Expression
1 df-ne 2782 . . . 4 (𝑃𝑄 ↔ ¬ 𝑃 = 𝑄)
21imbi1i 338 . . 3 ((𝑃𝑄 → (𝑃 𝑅) = (𝑄 𝑅)) ↔ (¬ 𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅)))
3 oveq1 6556 . . . 4 (𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅))
43biantrur 526 . . 3 ((¬ 𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅)) ↔ ((𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅)) ∧ (¬ 𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅))))
5 pm4.83 966 . . 3 (((𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅)) ∧ (¬ 𝑃 = 𝑄 → (𝑃 𝑅) = (𝑄 𝑅))) ↔ (𝑃 𝑅) = (𝑄 𝑅))
62, 4, 53bitrri 286 . 2 ((𝑃 𝑅) = (𝑄 𝑅) ↔ (𝑃𝑄 → (𝑃 𝑅) = (𝑄 𝑅)))
7 cvlsupr2.a . . . . 5 𝐴 = (Atoms‘𝐾)
8 cvlsupr2.l . . . . 5 = (le‘𝐾)
9 cvlsupr2.j . . . . 5 = (join‘𝐾)
107, 8, 9cvlsupr2 33648 . . . 4 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑅𝐴) ∧ 𝑃𝑄) → ((𝑃 𝑅) = (𝑄 𝑅) ↔ (𝑅𝑃𝑅𝑄𝑅 (𝑃 𝑄))))
11103expia 1259 . . 3 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → (𝑃𝑄 → ((𝑃 𝑅) = (𝑄 𝑅) ↔ (𝑅𝑃𝑅𝑄𝑅 (𝑃 𝑄)))))
1211pm5.74d 261 . 2 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → ((𝑃𝑄 → (𝑃 𝑅) = (𝑄 𝑅)) ↔ (𝑃𝑄 → (𝑅𝑃𝑅𝑄𝑅 (𝑃 𝑄)))))
136, 12syl5bb 271 1 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑅𝐴)) → ((𝑃 𝑅) = (𝑄 𝑅) ↔ (𝑃𝑄 → (𝑅𝑃𝑅𝑄𝑅 (𝑃 𝑄)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wne 2780   class class class wbr 4583  cfv 5804  (class class class)co 6549  lecple 15775  joincjn 16767  Atomscatm 33568  CvLatclc 33570
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-preset 16751  df-poset 16769  df-plt 16781  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-p0 16862  df-lat 16869  df-covers 33571  df-ats 33572  df-atl 33603  df-cvlat 33627
This theorem is referenced by:  ishlat3N  33659  hlsupr2  33691
  Copyright terms: Public domain W3C validator