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

Theorem 4atexlemntlpq 41316
Description: Lemma for 4atexlem7 41323. (Contributed by NM, 24-Nov-2012.)
Hypotheses
Ref Expression
4thatlem.ph (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑆 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)) ∧ (𝑇 ∈ 𝐴 ∧ (𝑈 ∨ 𝑇) = (𝑉 ∨ 𝑇))) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))))
4thatlem0.l ≤ = (le‘𝐾)
4thatlem0.j ∨ = (join‘𝐾)
4thatlem0.m ∧ = (meet‘𝐾)
4thatlem0.a 𝐴 = (Atoms‘𝐾)
4thatlem0.h 𝐻 = (LHyp‘𝐾)
4thatlem0.u 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
4thatlem0.v 𝑉 = ((𝑃 ∨ 𝑆) ∧ 𝑊)
Assertion
Ref Expression
4atexlemntlpq (𝜑 → ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))

Proof of Theorem 4atexlemntlpq
StepHypRef Expression
1 4thatlem.ph . . 3 (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑆 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊 ∧ (𝑃 ∨ 𝑅) = (𝑄 ∨ 𝑅)) ∧ (𝑇 ∈ 𝐴 ∧ (𝑈 ∨ 𝑇) = (𝑉 ∨ 𝑇))) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))))
2 4thatlem0.l . . 3 ≤ = (le‘𝐾)
3 4thatlem0.j . . 3 ∨ = (join‘𝐾)
4 4thatlem0.m . . 3 ∧ = (meet‘𝐾)
5 4thatlem0.a . . 3 𝐴 = (Atoms‘𝐾)
6 4thatlem0.h . . 3 𝐻 = (LHyp‘𝐾)
7 4thatlem0.u . . 3 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
8 4thatlem0.v . . 3 𝑉 = ((𝑃 ∨ 𝑆) ∧ 𝑊)
91, 2, 3, 4, 5, 6, 7, 84atexlemtlw 41315 . 2 (𝜑 → 𝑇 ≤ 𝑊)
1014atexlemkc 41306 . . . . . 6 (𝜑 → 𝐾 ∈ CvLat)
111, 2, 3, 4, 5, 6, 74atexlemu 41312 . . . . . 6 (𝜑 → 𝑈 ∈ 𝐴)
121, 2, 3, 4, 5, 6, 7, 84atexlemv 41313 . . . . . 6 (𝜑 → 𝑉 ∈ 𝐴)
1314atexlemt 41301 . . . . . 6 (𝜑 → 𝑇 ∈ 𝐴)
141, 2, 3, 4, 5, 6, 7, 84atexlemunv 41314 . . . . . 6 (𝜑 → 𝑈 ≠ 𝑉)
1514atexlemutvt 41302 . . . . . 6 (𝜑 → (𝑈 ∨ 𝑇) = (𝑉 ∨ 𝑇))
165, 3cvlsupr5 40594 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑈 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑈 ≠ 𝑉 ∧ (𝑈 ∨ 𝑇) = (𝑉 ∨ 𝑇))) → 𝑇 ≠ 𝑈)
1710, 11, 12, 13, 14, 15, 16syl132anc 1416 . . . . 5 (𝜑 → 𝑇 ≠ 𝑈)
1817adantr 486 . . . 4 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → 𝑇 ≠ 𝑈)
1914atexlemk 41295 . . . . . . 7 (𝜑 → 𝐾 ∈ HL)
2014atexlemw 41296 . . . . . . 7 (𝜑 → 𝑊 ∈ 𝐻)
2119, 20jca 521 . . . . . 6 (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2221adantr 486 . . . . 5 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2314atexlempw 41297 . . . . . 6 (𝜑 → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
2423adantr 486 . . . . 5 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
2514atexlemq 41299 . . . . . 6 (𝜑 → 𝑄 ∈ 𝐴)
2625adantr 486 . . . . 5 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → 𝑄 ∈ 𝐴)
2713adantr 486 . . . . 5 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → 𝑇 ∈ 𝐴)
2814atexlempnq 41303 . . . . . 6 (𝜑 → 𝑃 ≠ 𝑄)
2928adantr 486 . . . . 5 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ≠ 𝑄)
30 simpr 490 . . . . 5 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → 𝑇 ≤ (𝑃 ∨ 𝑄))
312, 3, 4, 5, 6, 7lhpat3 41294 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑄 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄))) → (¬ 𝑇 ≤ 𝑊 ↔ 𝑇 ≠ 𝑈))
3222, 24, 26, 27, 29, 30, 31syl222anc 1414 . . . 4 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → (¬ 𝑇 ≤ 𝑊 ↔ 𝑇 ≠ 𝑈))
3318, 32mpbird 260 . . 3 ((𝜑 ∧ 𝑇 ≤ (𝑃 ∨ 𝑄)) → ¬ 𝑇 ≤ 𝑊)
3433ex 418 . 2 (𝜑 → (𝑇 ≤ (𝑃 ∨ 𝑄) → ¬ 𝑇 ≤ 𝑊))
359, 34mt2d 137 1 (𝜑 → ¬ 𝑇 ≤ (𝑃 ∨ 𝑄))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  lecple 17461  joincjn 18511  meetcmee 18512  Atomscatm 40511  CvLatclc 40513  HLchlt 40598  LHypclh 41232
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-proset 18494  df-poset 18513  df-plt 18528  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-p0 18623  df-p1 18624  df-lat 18632  df-clat 18699  df-oposet 40424  df-ol 40426  df-oml 40427  df-covers 40514  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599  df-lhyp 41236
This theorem is used by:  4atexlemc  41317  4atexlemex2  41319  4atexlemcnd  41320
  Copyright terms: Public domain W3C validator