Metamath Proof Explorer


Theorem latjlej1

Description: Add join to both sides of a lattice ordering. ( chlej1i analog.) (Contributed by NM, 8-Nov-2011)

Ref Expression
Hypotheses latlej.b B=BaseK
latlej.l ˙=K
latlej.j ˙=joinK
Assertion latjlej1 KLatXBYBZBX˙YX˙Z˙Y˙Z

Proof

Step Hyp Ref Expression
1 latlej.b B=BaseK
2 latlej.l ˙=K
3 latlej.j ˙=joinK
4 1 2 3 latlej1 KLatYBZBY˙Y˙Z
5 4 3adant3r1 KLatXBYBZBY˙Y˙Z
6 simpl KLatXBYBZBKLat
7 simpr1 KLatXBYBZBXB
8 simpr2 KLatXBYBZBYB
9 1 3 latjcl KLatYBZBY˙ZB
10 9 3adant3r1 KLatXBYBZBY˙ZB
11 1 2 lattr KLatXBYBY˙ZBX˙YY˙Y˙ZX˙Y˙Z
12 6 7 8 10 11 syl13anc KLatXBYBZBX˙YY˙Y˙ZX˙Y˙Z
13 5 12 mpan2d KLatXBYBZBX˙YX˙Y˙Z
14 1 2 3 latlej2 KLatYBZBZ˙Y˙Z
15 14 3adant3r1 KLatXBYBZBZ˙Y˙Z
16 13 15 jctird KLatXBYBZBX˙YX˙Y˙ZZ˙Y˙Z
17 simpr3 KLatXBYBZBZB
18 7 17 10 3jca KLatXBYBZBXBZBY˙ZB
19 1 2 3 latjle12 KLatXBZBY˙ZBX˙Y˙ZZ˙Y˙ZX˙Z˙Y˙Z
20 18 19 syldan KLatXBYBZBX˙Y˙ZZ˙Y˙ZX˙Z˙Y˙Z
21 16 20 sylibd KLatXBYBZBX˙YX˙Z˙Y˙Z