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

Theorem cvlexchb1 39954
Description: An atomic covering lattice has the exchange property. (Contributed by NM, 16-Nov-2011.)
Hypotheses
Ref Expression
cvlexch.b 𝐵 = (Base‘𝐾)
cvlexch.l = (le‘𝐾)
cvlexch.j = (join‘𝐾)
cvlexch.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
cvlexchb1 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) ↔ (𝑋 𝑃) = (𝑋 𝑄)))

Proof of Theorem cvlexchb1
StepHypRef Expression
1 cvllat 39950 . . . . . . . . 9 (𝐾 ∈ CvLat → 𝐾 ∈ Lat)
21adantr 484 . . . . . . . 8 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝐾 ∈ Lat)
3 simpr3 1210 . . . . . . . 8 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑋𝐵)
4 simpr2 1209 . . . . . . . . 9 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑄𝐴)
5 cvlexch.b . . . . . . . . . 10 𝐵 = (Base‘𝐾)
6 cvlexch.a . . . . . . . . . 10 𝐴 = (Atoms‘𝐾)
75, 6atbase 39913 . . . . . . . . 9 (𝑄𝐴𝑄𝐵)
84, 7syl 17 . . . . . . . 8 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑄𝐵)
9 cvlexch.l . . . . . . . . 9 = (le‘𝐾)
10 cvlexch.j . . . . . . . . 9 = (join‘𝐾)
115, 9, 10latlej1 18480 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑄𝐵) → 𝑋 (𝑋 𝑄))
122, 3, 8, 11syl3anc 1390 . . . . . . 7 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑋 (𝑋 𝑄))
13123adant3 1145 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → 𝑋 (𝑋 𝑄))
1413adantr 484 . . . . 5 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → 𝑋 (𝑋 𝑄))
15 simpr 488 . . . . 5 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → 𝑃 (𝑋 𝑄))
16 simpr1 1208 . . . . . . . . 9 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑃𝐴)
175, 6atbase 39913 . . . . . . . . 9 (𝑃𝐴𝑃𝐵)
1816, 17syl 17 . . . . . . . 8 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑃𝐵)
195, 10latjcl 18471 . . . . . . . . 9 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑄𝐵) → (𝑋 𝑄) ∈ 𝐵)
202, 3, 8, 19syl3anc 1390 . . . . . . . 8 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → (𝑋 𝑄) ∈ 𝐵)
215, 9, 10latjle12 18482 . . . . . . . 8 ((𝐾 ∈ Lat ∧ (𝑋𝐵𝑃𝐵 ∧ (𝑋 𝑄) ∈ 𝐵)) → ((𝑋 (𝑋 𝑄) ∧ 𝑃 (𝑋 𝑄)) ↔ (𝑋 𝑃) (𝑋 𝑄)))
222, 3, 18, 20, 21syl13anc 1391 . . . . . . 7 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → ((𝑋 (𝑋 𝑄) ∧ 𝑃 (𝑋 𝑄)) ↔ (𝑋 𝑃) (𝑋 𝑄)))
23223adant3 1145 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → ((𝑋 (𝑋 𝑄) ∧ 𝑃 (𝑋 𝑄)) ↔ (𝑋 𝑃) (𝑋 𝑄)))
2423adantr 484 . . . . 5 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → ((𝑋 (𝑋 𝑄) ∧ 𝑃 (𝑋 𝑄)) ↔ (𝑋 𝑃) (𝑋 𝑄)))
2514, 15, 24mpbi2and 722 . . . 4 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → (𝑋 𝑃) (𝑋 𝑄))
265, 9, 10latlej1 18480 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑃𝐵) → 𝑋 (𝑋 𝑃))
272, 3, 18, 26syl3anc 1390 . . . . . . 7 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑋 (𝑋 𝑃))
28273adant3 1145 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → 𝑋 (𝑋 𝑃))
2928adantr 484 . . . . 5 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → 𝑋 (𝑋 𝑃))
305, 9, 10, 6cvlexch1 39952 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → 𝑄 (𝑋 𝑃)))
3130imp 410 . . . . 5 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → 𝑄 (𝑋 𝑃))
325, 10latjcl 18471 . . . . . . . . 9 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑃𝐵) → (𝑋 𝑃) ∈ 𝐵)
332, 3, 18, 32syl3anc 1390 . . . . . . . 8 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → (𝑋 𝑃) ∈ 𝐵)
345, 9, 10latjle12 18482 . . . . . . . 8 ((𝐾 ∈ Lat ∧ (𝑋𝐵𝑄𝐵 ∧ (𝑋 𝑃) ∈ 𝐵)) → ((𝑋 (𝑋 𝑃) ∧ 𝑄 (𝑋 𝑃)) ↔ (𝑋 𝑄) (𝑋 𝑃)))
352, 3, 8, 33, 34syl13anc 1391 . . . . . . 7 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → ((𝑋 (𝑋 𝑃) ∧ 𝑄 (𝑋 𝑃)) ↔ (𝑋 𝑄) (𝑋 𝑃)))
36353adant3 1145 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → ((𝑋 (𝑋 𝑃) ∧ 𝑄 (𝑋 𝑃)) ↔ (𝑋 𝑄) (𝑋 𝑃)))
3736adantr 484 . . . . 5 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → ((𝑋 (𝑋 𝑃) ∧ 𝑄 (𝑋 𝑃)) ↔ (𝑋 𝑄) (𝑋 𝑃)))
3829, 31, 37mpbi2and 722 . . . 4 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → (𝑋 𝑄) (𝑋 𝑃))
395, 9latasymb 18474 . . . . . . 7 ((𝐾 ∈ Lat ∧ (𝑋 𝑃) ∈ 𝐵 ∧ (𝑋 𝑄) ∈ 𝐵) → (((𝑋 𝑃) (𝑋 𝑄) ∧ (𝑋 𝑄) (𝑋 𝑃)) ↔ (𝑋 𝑃) = (𝑋 𝑄)))
402, 33, 20, 39syl3anc 1390 . . . . . 6 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → (((𝑋 𝑃) (𝑋 𝑄) ∧ (𝑋 𝑄) (𝑋 𝑃)) ↔ (𝑋 𝑃) = (𝑋 𝑄)))
41403adant3 1145 . . . . 5 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (((𝑋 𝑃) (𝑋 𝑄) ∧ (𝑋 𝑄) (𝑋 𝑃)) ↔ (𝑋 𝑃) = (𝑋 𝑄)))
4241adantr 484 . . . 4 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → (((𝑋 𝑃) (𝑋 𝑄) ∧ (𝑋 𝑄) (𝑋 𝑃)) ↔ (𝑋 𝑃) = (𝑋 𝑄)))
4325, 38, 42mpbi2and 722 . . 3 (((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) ∧ 𝑃 (𝑋 𝑄)) → (𝑋 𝑃) = (𝑋 𝑄))
4443ex 416 . 2 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → (𝑋 𝑃) = (𝑋 𝑄)))
455, 9, 10latlej2 18481 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑋𝐵𝑃𝐵) → 𝑃 (𝑋 𝑃))
462, 3, 18, 45syl3anc 1390 . . . 4 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → 𝑃 (𝑋 𝑃))
47 breq2 5104 . . . 4 ((𝑋 𝑃) = (𝑋 𝑄) → (𝑃 (𝑋 𝑃) ↔ 𝑃 (𝑋 𝑄)))
4846, 47syl5ibcom 247 . . 3 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵)) → ((𝑋 𝑃) = (𝑋 𝑄) → 𝑃 (𝑋 𝑄)))
49483adant3 1145 . 2 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → ((𝑋 𝑃) = (𝑋 𝑄) → 𝑃 (𝑋 𝑄)))
5044, 49impbid 214 1 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) ↔ (𝑋 𝑃) = (𝑋 𝑄)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399  w3a 1098   = wceq 1560  wcel 2142   class class class wbr 5100  cfv 6521  (class class class)co 7396  Basecbs 17245  lecple 17293  joincjn 18343  Latclat 18463  Atomscatm 39887  CvLatclc 39889
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-proset 18326  df-poset 18345  df-lub 18376  df-glb 18377  df-join 18378  df-meet 18379  df-lat 18464  df-ats 39891  df-atl 39922  df-cvlat 39946
This theorem is referenced by:  cvlexchb2  39955  cvlexch4N  39957  cvlatexchb1  39958  cvlcvr1  39963  hlexchb1  40008
  Copyright terms: Public domain W3C validator