Theorem cdlemg6 40625

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 2737	. . . 4 ⊢ ((trL‘𝐾)‘𝑊) = ((trL‘𝐾)‘𝑊)
13		eqid 2737	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
14		eqid 2737	. . . 4 ⊢ (((trL‘𝐾)‘𝑊)‘𝐺) = (((trL‘𝐾)‘𝑊)‘𝐺)
15	8, 9, 10, 11, 12, 13, 14	cdlemg6e 40624	. . 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 40619	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺)) ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
25	17, 18, 19, 20, 21, 22, 23, 24	syl133anc 1395	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) ∧ ¬ 𝑄 ≤ (𝑃(join‘𝐾)(((trL‘𝐾)‘𝑊)‘𝐺))) → (𝐹‘(𝐺‘𝑄)) = 𝑄)
26	16, 25	pm2.61dan 813	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝐹‘(𝐺‘𝑃)) = 𝑃)) → (𝐹‘(𝐺‘𝑄)) = 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108   class class class wbr 5143  ‘cfv 6561  (class class class)co 7431  lecple 17304  joincjn 18357  Atomscatm 39264  HLchlt 39351  LHypclh 39986  LTrncltrn 40103  trLctrl 40160

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-riotaBAD 38954

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-iin 4994  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-undef 8298  df-map 8868  df-proset 18340  df-poset 18359  df-plt 18375  df-lub 18391  df-glb 18392  df-join 18393  df-meet 18394  df-p0 18470  df-p1 18471  df-lat 18477  df-clat 18544  df-oposet 39177  df-ol 39179  df-oml 39180  df-covers 39267  df-ats 39268  df-atl 39299  df-cvlat 39323  df-hlat 39352  df-llines 39500  df-lplanes 39501  df-lvols 39502  df-lines 39503  df-psubsp 39505  df-pmap 39506  df-padd 39798  df-lhyp 39990  df-laut 39991  df-ldil 40106  df-ltrn 40107  df-trl 40161

This theorem is referenced by:  cdlemg7aN  40627  cdlemg8a  40629  cdlemg8c  40631  cdlemg11a  40639