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

Theorem psubspi2N 40997
Description: Property of a projective subspace. (Contributed by NM, 13-Jan-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
psubspset.l ≤ = (le‘𝐾)
psubspset.j ∨ = (join‘𝐾)
psubspset.a 𝐴 = (Atoms‘𝐾)
psubspset.s 𝑆 = (PSubSp‘𝐾)
Assertion
Ref Expression
psubspi2N (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ (𝑄 ∈ 𝑋 ∧ 𝑅 ∈ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) → 𝑃 ∈ 𝑋)

Proof of Theorem psubspi2N
Dummy variables 𝑟 𝑞 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 7450 . . . 4 (𝑞 = 𝑄 → (𝑞 ∨ 𝑟) = (𝑄 ∨ 𝑟))
21breq2d 5118 . . 3 (𝑞 = 𝑄 → (𝑃 ≤ (𝑞 ∨ 𝑟) ↔ 𝑃 ≤ (𝑄 ∨ 𝑟)))
3 oveq2 7451 . . . 4 (𝑟 = 𝑅 → (𝑄 ∨ 𝑟) = (𝑄 ∨ 𝑅))
43breq2d 5118 . . 3 (𝑟 = 𝑅 → (𝑃 ≤ (𝑄 ∨ 𝑟) ↔ 𝑃 ≤ (𝑄 ∨ 𝑅)))
52, 4rspc2ev 3592 . 2 ((𝑄 ∈ 𝑋 ∧ 𝑅 ∈ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅)) → ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟))
6 psubspset.l . . 3 ≤ = (le‘𝐾)
7 psubspset.j . . 3 ∨ = (join‘𝐾)
8 psubspset.a . . 3 𝐴 = (Atoms‘𝐾)
9 psubspset.s . . 3 𝑆 = (PSubSp‘𝐾)
106, 7, 8, 9psubspi 40996 . 2 (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)) → 𝑃 ∈ 𝑋)
115, 10sylan2 605 1 (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ (𝑄 ∈ 𝑋 ∧ 𝑅 ∈ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) → 𝑃 ∈ 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  lecple 17464  joincjn 18514  Atomscatm 40512  PSubSpcpsubsp 40745
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-ov 7446  df-psubsp 40752
This theorem is used by:  pclclN  41140  pclfinN  41149  pclfinclN  41199
  Copyright terms: Public domain W3C validator