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

Theorem lncmp 35387
 Description: If two lines are comparable, they are equal. (Contributed by NM, 30-Apr-2012.)
Hypotheses
Ref Expression
lncmp.b 𝐵 = (Base‘𝐾)
lncmp.l = (le‘𝐾)
lncmp.n 𝑁 = (Lines‘𝐾)
lncmp.m 𝑀 = (pmap‘𝐾)
Assertion
Ref Expression
lncmp (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 𝑌𝑋 = 𝑌))

Proof of Theorem lncmp
Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simplrl 817 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → (𝑀𝑋) ∈ 𝑁)
2 simpll1 1120 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → 𝐾 ∈ HL)
3 simpll2 1121 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → 𝑋𝐵)
4 lncmp.b . . . . . . 7 𝐵 = (Base‘𝐾)
5 eqid 2651 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
6 eqid 2651 . . . . . . 7 (Atoms‘𝐾) = (Atoms‘𝐾)
7 lncmp.n . . . . . . 7 𝑁 = (Lines‘𝐾)
8 lncmp.m . . . . . . 7 𝑀 = (pmap‘𝐾)
94, 5, 6, 7, 8isline3 35380 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝐵) → ((𝑀𝑋) ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞))))
102, 3, 9syl2anc 694 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → ((𝑀𝑋) ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞))))
111, 10mpbid 222 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))
12 simp3rr 1155 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 = (𝑝(join‘𝐾)𝑞))
13 simp1l1 1174 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝐾 ∈ HL)
14 simp1l3 1176 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑌𝐵)
15 simp1rr 1147 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → (𝑀𝑌) ∈ 𝑁)
16 simp3ll 1152 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ∈ (Atoms‘𝐾))
17 simp3lr 1153 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ∈ (Atoms‘𝐾))
18 simp3rl 1154 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝𝑞)
19 lncmp.l . . . . . . . . . 10 = (le‘𝐾)
20 hllat 34968 . . . . . . . . . . 11 (𝐾 ∈ HL → 𝐾 ∈ Lat)
2113, 20syl 17 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝐾 ∈ Lat)
224, 6atbase 34894 . . . . . . . . . . 11 (𝑝 ∈ (Atoms‘𝐾) → 𝑝𝐵)
2316, 22syl 17 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝𝐵)
24 simp1l2 1175 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋𝐵)
2519, 5, 6hlatlej1 34979 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → 𝑝 (𝑝(join‘𝐾)𝑞))
2613, 16, 17, 25syl3anc 1366 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 (𝑝(join‘𝐾)𝑞))
2726, 12breqtrrd 4713 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 𝑋)
28 simp2 1082 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 𝑌)
294, 19, 21, 23, 24, 14, 27, 28lattrd 17105 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 𝑌)
304, 6atbase 34894 . . . . . . . . . . 11 (𝑞 ∈ (Atoms‘𝐾) → 𝑞𝐵)
3117, 30syl 17 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞𝐵)
3219, 5, 6hlatlej2 34980 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → 𝑞 (𝑝(join‘𝐾)𝑞))
3313, 16, 17, 32syl3anc 1366 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 (𝑝(join‘𝐾)𝑞))
3433, 12breqtrrd 4713 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 𝑋)
354, 19, 21, 31, 24, 14, 34, 28lattrd 17105 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 𝑌)
364, 19, 5, 6, 7, 8lneq2at 35382 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑌𝐵 ∧ (𝑀𝑌) ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾) ∧ 𝑝𝑞) ∧ (𝑝 𝑌𝑞 𝑌)) → 𝑌 = (𝑝(join‘𝐾)𝑞))
3713, 14, 15, 16, 17, 18, 29, 35, 36syl332anc 1397 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑌 = (𝑝(join‘𝐾)𝑞))
3812, 37eqtr4d 2688 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 = 𝑌)
39383expia 1286 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → (((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞))) → 𝑋 = 𝑌))
4039expd 451 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → ((𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)) → 𝑋 = 𝑌)))
4140rexlimdvv 3066 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → (∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)) → 𝑋 = 𝑌))
4211, 41mpd 15 . . 3 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → 𝑋 = 𝑌)
4342ex 449 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 𝑌𝑋 = 𝑌))
44 simpl1 1084 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝐾 ∈ HL)
4544, 20syl 17 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝐾 ∈ Lat)
46 simpl2 1085 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝑋𝐵)
474, 19latref 17100 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋𝐵) → 𝑋 𝑋)
4845, 46, 47syl2anc 694 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝑋 𝑋)
49 breq2 4689 . . 3 (𝑋 = 𝑌 → (𝑋 𝑋𝑋 𝑌))
5048, 49syl5ibcom 235 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 = 𝑌𝑋 𝑌))
5143, 50impbid 202 1 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 𝑌𝑋 = 𝑌))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030   ≠ wne 2823  ∃wrex 2942   class class class wbr 4685  ‘cfv 5926  (class class class)co 6690  Basecbs 15904  lecple 15995  joincjn 16991  Latclat 17092  Atomscatm 34868  HLchlt 34955  Linesclines 35098  pmapcpmap 35101 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-preset 16975  df-poset 16993  df-plt 17005  df-lub 17021  df-glb 17022  df-join 17023  df-meet 17024  df-p0 17086  df-lat 17093  df-clat 17155  df-oposet 34781  df-ol 34783  df-oml 34784  df-covers 34871  df-ats 34872  df-atl 34903  df-cvlat 34927  df-hlat 34956  df-lines 35105  df-pmap 35108 This theorem is referenced by:  2lnat  35388
 Copyright terms: Public domain W3C validator