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

Theorem atcvrj0 40579
Description: Two atoms covering the zero subspace are equal. (atcv1 32988 analog.) (Contributed by NM, 29-Nov-2011.)
Hypotheses
Ref Expression
atcvrj0.b 𝐵 = (Base‘𝐾)
atcvrj0.j ∨ = (join‘𝐾)
atcvrj0.z 0 = (0.‘𝐾)
atcvrj0.c 𝐶 = ( ⋖ ‘𝐾)
atcvrj0.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
atcvrj0 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑋 = 0 ↔ 𝑃 = 𝑄))

Proof of Theorem atcvrj0
StepHypRef Expression
1 breq1 5105 . . . . . . . 8 (𝑋 = 0 → (𝑋𝐶(𝑃 ∨ 𝑄) ↔ 0 𝐶(𝑃 ∨ 𝑄)))
21biimpd 232 . . . . . . 7 (𝑋 = 0 → (𝑋𝐶(𝑃 ∨ 𝑄) → 0 𝐶(𝑃 ∨ 𝑄)))
32adantl 487 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑋 = 0 ) → (𝑋𝐶(𝑃 ∨ 𝑄) → 0 𝐶(𝑃 ∨ 𝑄)))
4 atcvrj0.j . . . . . . . . 9 ∨ = (join‘𝐾)
5 atcvrj0.z . . . . . . . . 9 0 = (0.‘𝐾)
6 atcvrj0.c . . . . . . . . 9 𝐶 = ( ⋖ ‘𝐾)
7 atcvrj0.a . . . . . . . . 9 𝐴 = (Atoms‘𝐾)
84, 5, 6, 7atcvr0eq 40577 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄))
983adant3r1 1201 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄))
109adantr 486 . . . . . 6 (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑋 = 0 ) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄))
113, 10sylibd 242 . . . . 5 (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑋 = 0 ) → (𝑋𝐶(𝑃 ∨ 𝑄) → 𝑃 = 𝑄))
1211ex 418 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 = 0 → (𝑋𝐶(𝑃 ∨ 𝑄) → 𝑃 = 𝑄)))
1312com23 87 . . 3 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑃 ∨ 𝑄) → (𝑋 = 0 → 𝑃 = 𝑄)))
14133impia 1135 . 2 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑋 = 0 → 𝑃 = 𝑄))
15 oveq1 7428 . . . . . . 7 (𝑃 = 𝑄 → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑄))
1615breq2d 5114 . . . . . 6 (𝑃 = 𝑄 → (𝑋𝐶(𝑃 ∨ 𝑄) ↔ 𝑋𝐶(𝑄 ∨ 𝑄)))
1716biimpac 484 . . . . 5 ((𝑋𝐶(𝑃 ∨ 𝑄) ∧ 𝑃 = 𝑄) → 𝑋𝐶(𝑄 ∨ 𝑄))
18 simpr3 1215 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
194, 7hlatjidm 40520 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄)
2018, 19syldan 603 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑄 ∨ 𝑄) = 𝑄)
2120breq2d 5114 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑄 ∨ 𝑄) ↔ 𝑋𝐶𝑄))
22 hlatl 40511 . . . . . . . . 9 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2322adantr 486 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝐾 ∈ AtLat)
24 simpr1 1213 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑋 ∈ 𝐵)
25 atcvrj0.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
26 eqid 2760 . . . . . . . . 9 (le‘𝐾) = (le‘𝐾)
2725, 26, 5, 6, 7atcvreq0 40465 . . . . . . . 8 ((𝐾 ∈ AtLat ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑋𝐶𝑄 ↔ 𝑋 = 0 ))
2823, 24, 18, 27syl3anc 1398 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶𝑄 ↔ 𝑋 = 0 ))
2928biimpd 232 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶𝑄 → 𝑋 = 0 ))
3021, 29sylbid 243 . . . . 5 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑄 ∨ 𝑄) → 𝑋 = 0 ))
3117, 30syl5 35 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋𝐶(𝑃 ∨ 𝑄) ∧ 𝑃 = 𝑄) → 𝑋 = 0 ))
3231expd 421 . . 3 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑃 ∨ 𝑄) → (𝑃 = 𝑄 → 𝑋 = 0 )))
33323impia 1135 . 2 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑃 = 𝑄 → 𝑋 = 0 ))
3414, 33impbid 215 1 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑋𝐶(𝑃 ∨ 𝑄)) → (𝑋 = 0 ↔ 𝑃 = 𝑄))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   class class class wbr 5102  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  lecple 17441  joincjn 18491  0.cp0 18601   ⋖ ccvr 40413  Atomscatm 40414  AtLatcal 40415  HLchlt 40501
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 7752
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 4585  df-pr 4587  df-op 4835  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 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-proset 18474  df-poset 18493  df-plt 18508  df-lub 18524  df-glb 18525  df-join 18526  df-meet 18527  df-p0 18603  df-lat 18612  df-clat 18679  df-oposet 40327  df-ol 40329  df-oml 40330  df-covers 40417  df-ats 40418  df-atl 40449  df-cvlat 40473  df-hlat 40502
This theorem is used by:  cvrat2  40580  atcvrneN  40581  atcvrj2b  40583
  Copyright terms: Public domain W3C validator