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

Theorem cdlemg15 41981
Description: Eliminate the ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) condition from cdlemg13 41977. TODO: FIX COMMENT. (Contributed by NM, 25-May-2013.)
Hypotheses
Ref Expression
cdlemg12.l ≤ = (le‘𝐾)
cdlemg12.j ∨ = (join‘𝐾)
cdlemg12.m ∧ = (meet‘𝐾)
cdlemg12.a 𝐴 = (Atoms‘𝐾)
cdlemg12.h 𝐻 = (LHyp‘𝐾)
cdlemg12.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg12b.r 𝑅 = ((trL‘𝐾)‘𝑊)
Assertion
Ref Expression
cdlemg15 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))

Proof of Theorem cdlemg15
StepHypRef Expression
1 simpl11 1269 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2 simpl12 1270 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
3 simpl13 1271 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
4 simpl2l 1247 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → 𝐹 ∈ 𝑇)
5 simpl2r 1248 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → 𝐺 ∈ 𝑇)
6 simpr 490 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄))
7 cdlemg12.l . . . 4 ≤ = (le‘𝐾)
8 cdlemg12.j . . . 4 ∨ = (join‘𝐾)
9 cdlemg12.m . . . 4 ∧ = (meet‘𝐾)
10 cdlemg12.a . . . 4 𝐴 = (Atoms‘𝐾)
11 cdlemg12.h . . . 4 𝐻 = (LHyp‘𝐾)
12 cdlemg12.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
137, 8, 9, 10, 11, 12cdlemg8 41956 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
141, 2, 3, 4, 5, 6, 13syl132anc 1418 . 2 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) = (𝑃 ∨ 𝑄)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
15 simpl1 1212 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄)) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
16 simpl2 1213 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄)) → (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇))
17 simpl3 1214 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄)) → (𝑅‘𝐹) = (𝑅‘𝐺))
18 simpr 490 . . 3 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄)) → ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))
19 cdlemg12b.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
207, 8, 9, 10, 11, 12, 19cdlemg15a 41980 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝐺) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
2115, 16, 17, 18, 20syl112anc 1404 . 2 (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
2214, 21pm2.61dane 3049 1 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150   ≠ wne 2962   class class class wbr 5107  ‘cfv 6565  (class class class)co 7450  lecple 17481  joincjn 18537  meetcmee 18538  Atomscatm 40588  HLchlt 40675  LHypclh 41309  LTrncltrn 41426  trLctrl 41483
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-riotaBAD 40278
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-undef 8327  df-map 8886  df-proset 18520  df-poset 18539  df-plt 18554  df-lub 18570  df-glb 18571  df-join 18572  df-meet 18573  df-p0 18649  df-p1 18650  df-lat 18658  df-clat 18725  df-oposet 40501  df-ol 40503  df-oml 40504  df-covers 40591  df-ats 40592  df-atl 40623  df-cvlat 40647  df-hlat 40676  df-llines 40823  df-lplanes 40824  df-lvols 40825  df-lines 40826  df-psubsp 40828  df-pmap 40829  df-padd 41121  df-lhyp 41313  df-laut 41314  df-ldil 41429  df-ltrn 41430  df-trl 41484
This theorem is used by:  cdlemg16  41982  cdlemg39  42041
  Copyright terms: Public domain W3C validator