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

Theorem cdlemf 37585
Description: Lemma F in [Crawley] p. 116. If u is an atom under w, there exists a translation whose trace is u. (Contributed by NM, 12-Apr-2013.)
Hypotheses
Ref Expression
cdlemf.l = (le‘𝐾)
cdlemf.a 𝐴 = (Atoms‘𝐾)
cdlemf.h 𝐻 = (LHyp‘𝐾)
cdlemf.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemf.r 𝑅 = ((trL‘𝐾)‘𝑊)
Assertion
Ref Expression
cdlemf (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) → ∃𝑓𝑇 (𝑅𝑓) = 𝑈)
Distinct variable groups:   𝐴,𝑓   𝑓,𝐻   𝑓,𝐾   ,𝑓   𝑇,𝑓   𝑈,𝑓   𝑓,𝑊
Allowed substitution hint:   𝑅(𝑓)

Proof of Theorem cdlemf
Dummy variables 𝑝 𝑞 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cdlemf.l . . 3 = (le‘𝐾)
2 eqid 2826 . . 3 (join‘𝐾) = (join‘𝐾)
3 cdlemf.a . . 3 𝐴 = (Atoms‘𝐾)
4 cdlemf.h . . 3 𝐻 = (LHyp‘𝐾)
5 eqid 2826 . . 3 (meet‘𝐾) = (meet‘𝐾)
61, 2, 3, 4, 5cdlemf2 37584 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) → ∃𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)))
7 simp1l 1191 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
8 simp2l 1193 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → 𝑝𝐴)
9 simp3ll 1238 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ¬ 𝑝 𝑊)
10 simp2r 1194 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → 𝑞𝐴)
11 simp3lr 1239 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ¬ 𝑞 𝑊)
12 cdlemf.t . . . . . . 7 𝑇 = ((LTrn‘𝐾)‘𝑊)
131, 3, 4, 12cdleme50ex 37581 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝𝐴 ∧ ¬ 𝑝 𝑊) ∧ (𝑞𝐴 ∧ ¬ 𝑞 𝑊)) → ∃𝑓𝑇 (𝑓𝑝) = 𝑞)
147, 8, 9, 10, 11, 13syl122anc 1373 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ∃𝑓𝑇 (𝑓𝑝) = 𝑞)
15 simp3r 1196 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → (𝑓𝑝) = 𝑞)
1615oveq2d 7166 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → (𝑝(join‘𝐾)(𝑓𝑝)) = (𝑝(join‘𝐾)𝑞))
1716oveq1d 7165 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → ((𝑝(join‘𝐾)(𝑓𝑝))(meet‘𝐾)𝑊) = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))
18 simp11 1197 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
19 simp3l 1195 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → 𝑓𝑇)
20 simp13l 1282 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → 𝑝𝐴)
21 simp2ll 1234 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → ¬ 𝑝 𝑊)
22 cdlemf.r . . . . . . . . . . . . 13 𝑅 = ((trL‘𝐾)‘𝑊)
231, 2, 5, 3, 4, 12, 22trlval2 37185 . . . . . . . . . . . 12 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝑓𝑇 ∧ (𝑝𝐴 ∧ ¬ 𝑝 𝑊)) → (𝑅𝑓) = ((𝑝(join‘𝐾)(𝑓𝑝))(meet‘𝐾)𝑊))
2418, 19, 20, 21, 23syl112anc 1368 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → (𝑅𝑓) = ((𝑝(join‘𝐾)(𝑓𝑝))(meet‘𝐾)𝑊))
25 simp2r 1194 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))
2617, 24, 253eqtr4d 2871 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓𝑇 ∧ (𝑓𝑝) = 𝑞)) → (𝑅𝑓) = 𝑈)
27263exp 1113 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊) ∧ (𝑝𝐴𝑞𝐴)) → (((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ((𝑓𝑇 ∧ (𝑓𝑝) = 𝑞) → (𝑅𝑓) = 𝑈)))
28273expia 1115 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) → ((𝑝𝐴𝑞𝐴) → (((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ((𝑓𝑇 ∧ (𝑓𝑝) = 𝑞) → (𝑅𝑓) = 𝑈))))
29283imp 1105 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ((𝑓𝑇 ∧ (𝑓𝑝) = 𝑞) → (𝑅𝑓) = 𝑈))
3029expd 416 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → (𝑓𝑇 → ((𝑓𝑝) = 𝑞 → (𝑅𝑓) = 𝑈)))
3130reximdvai 3277 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → (∃𝑓𝑇 (𝑓𝑝) = 𝑞 → ∃𝑓𝑇 (𝑅𝑓) = 𝑈))
3214, 31mpd 15 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) ∧ (𝑝𝐴𝑞𝐴) ∧ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ∃𝑓𝑇 (𝑅𝑓) = 𝑈)
33323exp 1113 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) → ((𝑝𝐴𝑞𝐴) → (((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ∃𝑓𝑇 (𝑅𝑓) = 𝑈)))
3433rexlimdvv 3298 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) → (∃𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ∃𝑓𝑇 (𝑅𝑓) = 𝑈))
356, 34mpd 15 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑈𝐴𝑈 𝑊)) → ∃𝑓𝑇 (𝑅𝑓) = 𝑈)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1081   = wceq 1530  wcel 2107  wrex 3144   class class class wbr 5063  cfv 6354  (class class class)co 7150  lecple 16567  joincjn 17549  meetcmee 17550  Atomscatm 36285  HLchlt 36372  LHypclh 37006  LTrncltrn 37123  trLctrl 37180
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-13 2385  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7455  ax-riotaBAD 35975
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-ral 3148  df-rex 3149  df-reu 3150  df-rmo 3151  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-iun 4919  df-iin 4920  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7685  df-2nd 7686  df-undef 7935  df-map 8403  df-proset 17533  df-poset 17551  df-plt 17563  df-lub 17579  df-glb 17580  df-join 17581  df-meet 17582  df-p0 17644  df-p1 17645  df-lat 17651  df-clat 17713  df-oposet 36198  df-ol 36200  df-oml 36201  df-covers 36288  df-ats 36289  df-atl 36320  df-cvlat 36344  df-hlat 36373  df-llines 36520  df-lplanes 36521  df-lvols 36522  df-lines 36523  df-psubsp 36525  df-pmap 36526  df-padd 36818  df-lhyp 37010  df-laut 37011  df-ldil 37126  df-ltrn 37127  df-trl 37181
This theorem is referenced by:  cdlemfnid  37586  trlord  37591  dih1dimb2  38263
  Copyright terms: Public domain W3C validator