Theorem cdlemg6 38221

Description: TODO: FIX COMMENT. (Contributed by NM, 27-Apr-2013.)

Hypotheses

Ref	Expression
cdlemg6.l	⊢ ≤ = (le‘𝐾)
cdlemg6.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg6.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg6.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)

Assertion

Ref	Expression
cdlemg6	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)

Proof of Theorem cdlemg6

Step	Hyp	Ref	Expression
1		simpl1 1188	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simpl2l 1223	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
3		simpl2r 1224	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
4		simpl31 1251	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐹 ∈ 𝑇)
5		simpl32 1252	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐺 ∈ 𝑇)
6		simpr 488	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)))
7		simpl33 1253	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑃)) = 𝑃)
8		cdlemg6.l	. . . 4 ⊢ ≤ = (le‘𝐾)
9		cdlemg6.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
10		cdlemg6.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
11		cdlemg6.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
12		eqid 2758	. . . 4 ⊢ ((trL‘𝐾)‘𝑊) = ((trL‘𝐾)‘𝑊)
13		eqid 2758	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
14		eqid 2758	. . . 4 ⊢ (((trL‘𝐾)‘𝑊)‘𝐺) = (((trL‘𝐾)‘𝑊)‘𝐺)
15	8, 9, 10, 11, 12, 13, 14	cdlemg6e 38220	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)) ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
16	1, 2, 3, 4, 5, 6, 7, 15	syl133anc 1390	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
17		simpl1 1188	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
18		simpl2l 1223	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
19		simpl2r 1224	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
20		simpl31 1251	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐹 ∈ 𝑇)
21		simpl32 1252	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐺 ∈ 𝑇)
22		simpr 488	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)))
23		simpl33 1253	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑃)) = 𝑃)
24	8, 9, 10, 11, 12, 13, 14	cdlemg4 38215	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)) ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
25	17, 18, 19, 20, 21, 22, 23, 24	syl133anc 1390	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
26	16, 25	pm2.61dan 812	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   class class class wbr 5032  ‘cfv 6335  (class class class)co 7150  lecple 16630  joincjn 17620  Atomscatm 36861  HLchlt 36948  LHypclh 37582  LTrncltrn 37699  trLctrl 37756

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5156  ax-sep 5169  ax-nul 5176  ax-pow 5234  ax-pr 5298  ax-un 7459  ax-riotaBAD 36551

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-reu 3077  df-rmo 3078  df-rab 3079  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-nul 4226  df-if 4421  df-pw 4496  df-sn 4523  df-pr 4525  df-op 4529  df-uni 4799  df-iun 4885  df-iin 4886  df-br 5033  df-opab 5095  df-mpt 5113  df-id 5430  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-iota 6294  df-fun 6337  df-fn 6338  df-f 6339  df-f1 6340  df-fo 6341  df-f1o 6342  df-fv 6343  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7693  df-2nd 7694  df-undef 7949  df-map 8418  df-proset 17604  df-poset 17622  df-plt 17634  df-lub 17650  df-glb 17651  df-join 17652  df-meet 17653  df-p0 17715  df-p1 17716  df-lat 17722  df-clat 17784  df-oposet 36774  df-ol 36776  df-oml 36777  df-covers 36864  df-ats 36865  df-atl 36896  df-cvlat 36920  df-hlat 36949  df-llines 37096  df-lplanes 37097  df-lvols 37098  df-lines 37099  df-psubsp 37101  df-pmap 37102  df-padd 37394  df-lhyp 37586  df-laut 37587  df-ldil 37702  df-ltrn 37703  df-trl 37757

This theorem is referenced by:  cdlemg7aN  38223  cdlemg8a  38225  cdlemg8c  38227  cdlemg11a  38235