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

Theorem linepmap 40832
Description: A line described with a projective map. (Contributed by NM, 3-Feb-2012.)
Hypotheses
Ref Expression
isline2.j ∨ = (join‘𝐾)
isline2.a 𝐴 = (Atoms‘𝐾)
isline2.n 𝑁 = (Lines‘𝐾)
isline2.m 𝑀 = (pmap‘𝐾)
Assertion
Ref Expression
linepmap (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) ∈ 𝑁)

Proof of Theorem linepmap
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 simpl1 1210 . . 3 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝐾 ∈ Lat)
2 simpl2 1211 . . . . 5 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ 𝐴)
3 eqid 2761 . . . . . 6 (Base‘𝐾) = (Base‘𝐾)
4 isline2.a . . . . . 6 𝐴 = (Atoms‘𝐾)
53, 4atbase 40346 . . . . 5 (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
62, 5syl 18 . . . 4 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ (Base‘𝐾))
7 simpl3 1212 . . . . 5 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ 𝐴)
83, 4atbase 40346 . . . . 5 (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
97, 8syl 18 . . . 4 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ (Base‘𝐾))
10 isline2.j . . . . 5 ∨ = (join‘𝐾)
113, 10latjcl 18613 . . . 4 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
121, 6, 9, 11syl3anc 1398 . . 3 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
13 eqid 2761 . . . 4 (le‘𝐾) = (le‘𝐾)
14 isline2.m . . . 4 𝑀 = (pmap‘𝐾)
153, 13, 4, 14pmapval 40814 . . 3 ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)})
161, 12, 15syl2anc 596 . 2 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)})
17 eqid 2761 . . 3 {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}
18 isline2.n . . . 4 𝑁 = (Lines‘𝐾)
1913, 10, 4, 18islinei 40797 . . 3 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)})) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁)
2017, 19mpanr2 717 . 2 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁)
2116, 20eqeltrd 2861 1 (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) ∈ 𝑁)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  {crab 3413   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  joincjn 18485  Latclat 18605  Atomscatm 40320  Linesclines 40551  pmapcpmap 40554
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-lub 18518  df-glb 18519  df-join 18520  df-meet 18521  df-lat 18606  df-ats 40324  df-lines 40558  df-pmap 40561
This theorem is used by:  cdleme3h  41292  cdleme7ga  41305
  Copyright terms: Public domain W3C validator