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

Theorem exatleN 40727
Description: A condition for an atom to be less than or equal to a lattice element. Part of proof of Lemma A in [Crawley] p. 112. (Contributed by NM, 28-Apr-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
atomle.b 𝐵 = (Base‘𝐾)
atomle.l ≤ = (le‘𝐾)
atomle.j ∨ = (join‘𝐾)
atomle.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
exatleN (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 ↔ 𝑅 = 𝑃))

Proof of Theorem exatleN
StepHypRef Expression
1 simpl32 1274 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → ¬ 𝑄 ≤ 𝑋)
2 atomle.b . . . . . . 7 𝐵 = (Base‘𝐾)
3 atomle.l . . . . . . 7 ≤ = (le‘𝐾)
4 simp11l 1303 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝐾 ∈ HL)
54hllatd 40687 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝐾 ∈ Lat)
6 simp122 1325 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ∈ 𝐴)
7 atomle.a . . . . . . . . 9 𝐴 = (Atoms‘𝐾)
82, 7atbase 40612 . . . . . . . 8 (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
96, 8syl 18 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ∈ 𝐵)
10 simp121 1324 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ∈ 𝐴)
112, 7atbase 40612 . . . . . . . . 9 (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
1210, 11syl 18 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ∈ 𝐵)
13 simp123 1326 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ∈ 𝐴)
142, 7atbase 40612 . . . . . . . . 9 (𝑅 ∈ 𝐴 → 𝑅 ∈ 𝐵)
1513, 14syl 18 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ∈ 𝐵)
16 atomle.j . . . . . . . . 9 ∨ = (join‘𝐾)
172, 16latjcl 18663 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑅 ∈ 𝐵) → (𝑃 ∨ 𝑅) ∈ 𝐵)
185, 12, 15, 17syl3anc 1399 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑃 ∨ 𝑅) ∈ 𝐵)
19 simp11r 1304 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑋 ∈ 𝐵)
2013, 6, 103jca 1146 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
21 simp2 1155 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≠ 𝑃)
224, 20, 213jca 1146 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑅 ≠ 𝑃))
23 simp133 1329 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≤ (𝑃 ∨ 𝑄))
243, 16, 7hlatexch1 40718 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑅 ≠ 𝑃) → (𝑅 ≤ (𝑃 ∨ 𝑄) → 𝑄 ≤ (𝑃 ∨ 𝑅)))
2522, 23, 24sylc 66 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ≤ (𝑃 ∨ 𝑅))
26 simp131 1327 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ≤ 𝑋)
27 simp3 1156 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≤ 𝑋)
282, 3, 16latjle12 18674 . . . . . . . . 9 ((𝐾 ∈ Lat ∧ (𝑃 ∈ 𝐵 ∧ 𝑅 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 ≤ 𝑋 ∧ 𝑅 ≤ 𝑋) ↔ (𝑃 ∨ 𝑅) ≤ 𝑋))
295, 12, 15, 19, 28syl13anc 1400 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → ((𝑃 ≤ 𝑋 ∧ 𝑅 ≤ 𝑋) ↔ (𝑃 ∨ 𝑅) ≤ 𝑋))
3026, 27, 29mpbi2and 725 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑃 ∨ 𝑅) ≤ 𝑋)
312, 3, 5, 9, 18, 19, 25, 30lattrd 18670 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ≤ 𝑋)
32313expia 1139 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → (𝑅 ≤ 𝑋 → 𝑄 ≤ 𝑋))
331, 32mtod 201 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → ¬ 𝑅 ≤ 𝑋)
3433ex 418 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≠ 𝑃 → ¬ 𝑅 ≤ 𝑋))
3534necon4ad 2978 . 2 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 → 𝑅 = 𝑃))
36 simp31 1228 . . 3 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ≤ 𝑋)
37 breq1 5111 . . 3 (𝑅 = 𝑃 → (𝑅 ≤ 𝑋 ↔ 𝑃 ≤ 𝑋))
3836, 37syl5ibrcom 250 . 2 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 = 𝑃 → 𝑅 ≤ 𝑋))
3935, 38impbid 215 1 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 ↔ 𝑅 = 𝑃))
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 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  lecple 17479  joincjn 18535  Latclat 18655  Atomscatm 40586  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-covers 40589  df-ats 40590  df-atl 40621  df-cvlat 40645  df-hlat 40674
This theorem is used by:  cdlema2N  41115
  Copyright terms: Public domain W3C validator