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 40751
Description: Two atoms covering the zero subspace are equal. (atcv1 33039 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 5111 . . . . . . . 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 40749 . . . . . . . 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 7458 . . . . . . 7 (𝑃 = 𝑄 → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑄))
1615breq2d 5120 . . . . . 6 (𝑃 = 𝑄 → (𝑋𝐶(𝑃 ∨ 𝑄) ↔ 𝑋𝐶(𝑄 ∨ 𝑄)))
1716biimpac 484 . . . . 5 ((𝑋𝐶(𝑃 ∨ 𝑄) ∧ 𝑃 = 𝑄) → 𝑋𝐶(𝑄 ∨ 𝑄))
18 simpr3 1215 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
194, 7hlatjidm 40692 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄)
2018, 19syldan 603 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑄 ∨ 𝑄) = 𝑄)
2120breq2d 5120 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋𝐶(𝑄 ∨ 𝑄) ↔ 𝑋𝐶𝑄))
22 hlatl 40683 . . . . . . . . 9 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2322adantr 486 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝐾 ∈ AtLat)
24 simpr1 1213 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑋 ∈ 𝐵)
25 atcvrj0.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
26 eqid 2763 . . . . . . . . 9 (le‘𝐾) = (le‘𝐾)
2725, 26, 5, 6, 7atcvreq0 40637 . . . . . . . 8 ((𝐾 ∈ AtLat ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑋𝐶𝑄 ↔ 𝑋 = 0 ))
2823, 24, 18, 27syl3anc 1399 . . . . . . 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 1570   ∈ wcel 2147   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  lecple 17479  joincjn 18535  0.cp0 18645   ⋖ ccvr 40585  Atomscatm 40586  AtLatcal 40587  HLchlt 40673
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-proset 18518  df-poset 18537  df-plt 18552  df-lub 18568  df-glb 18569  df-join 18570  df-meet 18571  df-p0 18647  df-lat 18656  df-clat 18723  df-oposet 40499  df-ol 40501  df-oml 40502  df-covers 40589  df-ats 40590  df-atl 40621  df-cvlat 40645  df-hlat 40674
This theorem is used by:  cvrat2  40752  atcvrneN  40753  atcvrj2b  40755
  Copyright terms: Public domain W3C validator