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

Theorem lncmp 36955
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 775 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → (𝑀𝑋) ∈ 𝑁)
2 simpll1 1208 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → 𝐾 ∈ HL)
3 simpll2 1209 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → 𝑋𝐵)
4 lncmp.b . . . . . . 7 𝐵 = (Base‘𝐾)
5 eqid 2820 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
6 eqid 2820 . . . . . . 7 (Atoms‘𝐾) = (Atoms‘𝐾)
7 lncmp.n . . . . . . 7 𝑁 = (Lines‘𝐾)
8 lncmp.m . . . . . . 7 𝑀 = (pmap‘𝐾)
94, 5, 6, 7, 8isline3 36948 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝐵) → ((𝑀𝑋) ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞))))
102, 3, 9syl2anc 586 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → ((𝑀𝑋) ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞))))
111, 10mpbid 234 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))
12 simp3rr 1243 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 = (𝑝(join‘𝐾)𝑞))
13 simp1l1 1262 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝐾 ∈ HL)
14 simp1l3 1264 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑌𝐵)
15 simp1rr 1235 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → (𝑀𝑌) ∈ 𝑁)
16 simp3ll 1240 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ∈ (Atoms‘𝐾))
17 simp3lr 1241 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ∈ (Atoms‘𝐾))
18 simp3rl 1242 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝𝑞)
19 lncmp.l . . . . . . . . . 10 = (le‘𝐾)
2013hllatd 36536 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝐾 ∈ Lat)
214, 6atbase 36461 . . . . . . . . . . 11 (𝑝 ∈ (Atoms‘𝐾) → 𝑝𝐵)
2216, 21syl 17 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝𝐵)
23 simp1l2 1263 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋𝐵)
2419, 5, 6hlatlej1 36547 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → 𝑝 (𝑝(join‘𝐾)𝑞))
2513, 16, 17, 24syl3anc 1367 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 (𝑝(join‘𝐾)𝑞))
2625, 12breqtrrd 5070 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 𝑋)
27 simp2 1133 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 𝑌)
284, 19, 20, 22, 23, 14, 26, 27lattrd 17647 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 𝑌)
294, 6atbase 36461 . . . . . . . . . . 11 (𝑞 ∈ (Atoms‘𝐾) → 𝑞𝐵)
3017, 29syl 17 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞𝐵)
3119, 5, 6hlatlej2 36548 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → 𝑞 (𝑝(join‘𝐾)𝑞))
3213, 16, 17, 31syl3anc 1367 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 (𝑝(join‘𝐾)𝑞))
3332, 12breqtrrd 5070 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 𝑋)
344, 19, 20, 30, 23, 14, 33, 27lattrd 17647 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 𝑌)
354, 19, 5, 6, 7, 8lneq2at 36950 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑌𝐵 ∧ (𝑀𝑌) ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾) ∧ 𝑝𝑞) ∧ (𝑝 𝑌𝑞 𝑌)) → 𝑌 = (𝑝(join‘𝐾)𝑞))
3613, 14, 15, 16, 17, 18, 28, 34, 35syl332anc 1397 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑌 = (𝑝(join‘𝐾)𝑞))
3712, 36eqtr4d 2858 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 = 𝑌)
38373expia 1117 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → (((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞))) → 𝑋 = 𝑌))
3938expd 418 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → ((𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)) → 𝑋 = 𝑌)))
4039rexlimdvv 3280 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → (∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝𝑞𝑋 = (𝑝(join‘𝐾)𝑞)) → 𝑋 = 𝑌))
4111, 40mpd 15 . . 3 ((((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) ∧ 𝑋 𝑌) → 𝑋 = 𝑌)
4241ex 415 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 𝑌𝑋 = 𝑌))
43 simpl1 1187 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝐾 ∈ HL)
4443hllatd 36536 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝐾 ∈ Lat)
45 simpl2 1188 . . . 4 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝑋𝐵)
464, 19latref 17642 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋𝐵) → 𝑋 𝑋)
4744, 45, 46syl2anc 586 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → 𝑋 𝑋)
48 breq2 5046 . . 3 (𝑋 = 𝑌 → (𝑋 𝑋𝑋 𝑌))
4947, 48syl5ibcom 247 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 = 𝑌𝑋 𝑌))
5042, 49impbid 214 1 (((𝐾 ∈ HL ∧ 𝑋𝐵𝑌𝐵) ∧ ((𝑀𝑋) ∈ 𝑁 ∧ (𝑀𝑌) ∈ 𝑁)) → (𝑋 𝑌𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1537  wcel 2114  wne 3006  wrex 3126   class class class wbr 5042  cfv 6331  (class class class)co 7133  Basecbs 16462  lecple 16551  joincjn 17533  Latclat 17634  Atomscatm 36435  HLchlt 36522  Linesclines 36666  pmapcpmap 36669
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-ral 3130  df-rex 3131  df-reu 3132  df-rab 3134  df-v 3475  df-sbc 3753  df-csb 3861  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4270  df-if 4444  df-pw 4517  df-sn 4544  df-pr 4546  df-op 4550  df-uni 4815  df-iun 4897  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5436  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-ima 5544  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-f1 6336  df-fo 6337  df-f1o 6338  df-fv 6339  df-riota 7091  df-ov 7136  df-oprab 7137  df-proset 17517  df-poset 17535  df-plt 17547  df-lub 17563  df-glb 17564  df-join 17565  df-meet 17566  df-p0 17628  df-lat 17635  df-clat 17697  df-oposet 36348  df-ol 36350  df-oml 36351  df-covers 36438  df-ats 36439  df-atl 36470  df-cvlat 36494  df-hlat 36523  df-lines 36673  df-pmap 36676
This theorem is referenced by:  2lnat  36956
  Copyright terms: Public domain W3C validator