Theorem cdlemg6 40822

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 1192	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simpl2l 1227	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
3		simpl2r 1228	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
4		simpl31 1255	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐹 ∈ 𝑇)
5		simpl32 1256	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐺 ∈ 𝑇)
6		simpr 484	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)))
7		simpl33 1257	. . 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 2734	. . . 4 ⊢ ((trL‘𝐾)‘𝑊) = ((trL‘𝐾)‘𝑊)
13		eqid 2734	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
14		eqid 2734	. . . 4 ⊢ (((trL‘𝐾)‘𝑊)‘𝐺) = (((trL‘𝐾)‘𝑊)‘𝐺)
15	8, 9, 10, 11, 12, 13, 14	cdlemg6e 40821	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)) ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
16	1, 2, 3, 4, 5, 6, 7, 15	syl133anc 1395	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
17		simpl1 1192	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
18		simpl2l 1227	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
19		simpl2r 1228	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
20		simpl31 1255	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐹 ∈ 𝑇)
21		simpl32 1256	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → 𝐺 ∈ 𝑇)
22		simpr 484	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)))
23		simpl33 1257	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑃)) = 𝑃)
24	8, 9, 10, 11, 12, 13, 14	cdlemg4 40816	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)) ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
25	17, 18, 19, 20, 21, 22, 23, 24	syl133anc 1395	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
26	16, 25	pm2.61dan 812	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   class class class wbr 5096  ‘cfv 6490  (class class class)co 7356  lecple 17182  joincjn 18232  Atomscatm 39462  HLchlt 39549  LHypclh 40183  LTrncltrn 40300  trLctrl 40357

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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-riotaBAD 39152

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-undef 8213  df-map 8763  df-proset 18215  df-poset 18234  df-plt 18249  df-lub 18265  df-glb 18266  df-join 18267  df-meet 18268  df-p0 18344  df-p1 18345  df-lat 18353  df-clat 18420  df-oposet 39375  df-ol 39377  df-oml 39378  df-covers 39465  df-ats 39466  df-atl 39497  df-cvlat 39521  df-hlat 39550  df-llines 39697  df-lplanes 39698  df-lvols 39699  df-lines 39700  df-psubsp 39702  df-pmap 39703  df-padd 39995  df-lhyp 40187  df-laut 40188  df-ldil 40303  df-ltrn 40304  df-trl 40358

This theorem is referenced by:  cdlemg7aN  40824  cdlemg8a  40826  cdlemg8c  40828  cdlemg11a  40836