| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elpadd2at | Structured version Visualization version GIF version | ||
| Description: Membership in a projective subspace sum of two points. (Contributed by NM, 29-Jan-2012.) |
| Ref | Expression |
|---|---|
| paddfval.l | ⊢ ≤ = (le‘𝐾) |
| paddfval.j | ⊢ ∨ = (join‘𝐾) |
| paddfval.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| paddfval.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| elpadd2at | ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑆 ∈ ({𝑄} + {𝑅}) ↔ (𝑆 ∈ 𝐴 ∧ 𝑆 ≤ (𝑄 ∨ 𝑅)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → 𝐾 ∈ Lat) | |
| 2 | simp2 1155 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → 𝑄 ∈ 𝐴) | |
| 3 | 2 | snssd 4749 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → {𝑄} ⊆ 𝐴) |
| 4 | simp3 1156 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → 𝑅 ∈ 𝐴) | |
| 5 | snnzg 4737 | . . . 4 ⊢ (𝑄 ∈ 𝐴 → {𝑄} ≠ ∅) | |
| 6 | 5 | 3ad2ant2 1152 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → {𝑄} ≠ ∅) |
| 7 | paddfval.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 8 | paddfval.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 9 | paddfval.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | paddfval.p | . . . 4 ⊢ + = (+𝑃‘𝐾) | |
| 11 | 7, 8, 9, 10 | elpaddat 41127 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ {𝑄} ⊆ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ {𝑄} ≠ ∅) → (𝑆 ∈ ({𝑄} + {𝑅}) ↔ (𝑆 ∈ 𝐴 ∧ ∃𝑟 ∈ {𝑄}𝑆 ≤ (𝑟 ∨ 𝑅)))) |
| 12 | 1, 3, 4, 6, 11 | syl31anc 1401 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑆 ∈ ({𝑄} + {𝑅}) ↔ (𝑆 ∈ 𝐴 ∧ ∃𝑟 ∈ {𝑄}𝑆 ≤ (𝑟 ∨ 𝑅)))) |
| 13 | oveq1 7458 | . . . . . 6 ⊢ (𝑟 = 𝑄 → (𝑟 ∨ 𝑅) = (𝑄 ∨ 𝑅)) | |
| 14 | 13 | breq2d 5120 | . . . . 5 ⊢ (𝑟 = 𝑄 → (𝑆 ≤ (𝑟 ∨ 𝑅) ↔ 𝑆 ≤ (𝑄 ∨ 𝑅))) |
| 15 | 14 | rexsng 4638 | . . . 4 ⊢ (𝑄 ∈ 𝐴 → (∃𝑟 ∈ {𝑄}𝑆 ≤ (𝑟 ∨ 𝑅) ↔ 𝑆 ≤ (𝑄 ∨ 𝑅))) |
| 16 | 15 | 3ad2ant2 1152 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (∃𝑟 ∈ {𝑄}𝑆 ≤ (𝑟 ∨ 𝑅) ↔ 𝑆 ≤ (𝑄 ∨ 𝑅))) |
| 17 | 16 | anbi2d 642 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → ((𝑆 ∈ 𝐴 ∧ ∃𝑟 ∈ {𝑄}𝑆 ≤ (𝑟 ∨ 𝑅)) ↔ (𝑆 ∈ 𝐴 ∧ 𝑆 ≤ (𝑄 ∨ 𝑅)))) |
| 18 | 12, 17 | bitrd 282 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑆 ∈ ({𝑄} + {𝑅}) ↔ (𝑆 ∈ 𝐴 ∧ 𝑆 ≤ (𝑄 ∨ 𝑅)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 ⊆ wss 3900 ∅c0 4281 {csn 4588 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 lecple 17479 joincjn 18535 Latclat 18655 Atomscatm 40586 +𝑃cpadd 41118 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-lub 18568 df-join 18570 df-lat 18656 df-ats 40590 df-padd 41119 |
| This theorem is used by: elpadd2at2 41130 |
| Copyright terms: Public domain | W3C validator |