Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > psubspi2N | Structured version Visualization version GIF version |
Description: Property of a projective subspace. (Contributed by NM, 13-Jan-2012.) (New usage is discouraged.) |
Ref | Expression |
---|---|
psubspset.l | ⊢ ≤ = (le‘𝐾) |
psubspset.j | ⊢ ∨ = (join‘𝐾) |
psubspset.a | ⊢ 𝐴 = (Atoms‘𝐾) |
psubspset.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
Ref | Expression |
---|---|
psubspi2N | ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ (𝑄 ∈ 𝑋 ∧ 𝑅 ∈ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) → 𝑃 ∈ 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 7152 | . . . 4 ⊢ (𝑞 = 𝑄 → (𝑞 ∨ 𝑟) = (𝑄 ∨ 𝑟)) | |
2 | 1 | breq2d 5069 | . . 3 ⊢ (𝑞 = 𝑄 → (𝑃 ≤ (𝑞 ∨ 𝑟) ↔ 𝑃 ≤ (𝑄 ∨ 𝑟))) |
3 | oveq2 7153 | . . . 4 ⊢ (𝑟 = 𝑅 → (𝑄 ∨ 𝑟) = (𝑄 ∨ 𝑅)) | |
4 | 3 | breq2d 5069 | . . 3 ⊢ (𝑟 = 𝑅 → (𝑃 ≤ (𝑄 ∨ 𝑟) ↔ 𝑃 ≤ (𝑄 ∨ 𝑅))) |
5 | 2, 4 | rspc2ev 3632 | . 2 ⊢ ((𝑄 ∈ 𝑋 ∧ 𝑅 ∈ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅)) → ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)) |
6 | psubspset.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
7 | psubspset.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
8 | psubspset.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
9 | psubspset.s | . . 3 ⊢ 𝑆 = (PSubSp‘𝐾) | |
10 | 6, 7, 8, 9 | psubspi 36763 | . 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)) → 𝑃 ∈ 𝑋) |
11 | 5, 10 | sylan2 592 | 1 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ (𝑄 ∈ 𝑋 ∧ 𝑅 ∈ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑅))) → 𝑃 ∈ 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ∃wrex 3136 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 lecple 16560 joincjn 17542 Atomscatm 36279 PSubSpcpsubsp 36512 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-iota 6307 df-fun 6350 df-fv 6356 df-ov 7148 df-psubsp 36519 |
This theorem is referenced by: pclclN 36907 pclfinN 36916 pclfinclN 36966 |
Copyright terms: Public domain | W3C validator |