| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapeq0 | Structured version Visualization version GIF version | ||
| Description: A projective map value is zero iff its argument is lattice zero. (Contributed by NM, 27-Jan-2012.) |
| Ref | Expression |
|---|---|
| pmapeq0.b | ⊢ 𝐵 = (Base‘𝐾) |
| pmapeq0.z | ⊢ 0 = (0.‘𝐾) |
| pmapeq0.m | ⊢ 𝑀 = (pmap‘𝐾) |
| Ref | Expression |
|---|---|
| pmapeq0 | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑀‘𝑋) = ∅ ↔ 𝑋 = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hlatl 40019 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat) | |
| 2 | 1 | adantr 485 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ AtLat) |
| 3 | pmapeq0.z | . . . . 5 ⊢ 0 = (0.‘𝐾) | |
| 4 | pmapeq0.m | . . . . 5 ⊢ 𝑀 = (pmap‘𝐾) | |
| 5 | 3, 4 | pmap0 40424 | . . . 4 ⊢ (𝐾 ∈ AtLat → (𝑀‘ 0 ) = ∅) |
| 6 | 2, 5 | syl 18 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘ 0 ) = ∅) |
| 7 | 6 | eqeq2d 2780 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑀‘𝑋) = (𝑀‘ 0 ) ↔ (𝑀‘𝑋) = ∅)) |
| 8 | hlop 40021 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP) | |
| 9 | 8 | adantr 485 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ OP) |
| 10 | pmapeq0.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 11 | 10, 3 | op0cl 39843 | . . . 4 ⊢ (𝐾 ∈ OP → 0 ∈ 𝐵) |
| 12 | 9, 11 | syl 18 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 0 ∈ 𝐵) |
| 13 | 10, 4 | pmap11 40421 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → ((𝑀‘𝑋) = (𝑀‘ 0 ) ↔ 𝑋 = 0 )) |
| 14 | 12, 13 | mpd3an3 1488 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑀‘𝑋) = (𝑀‘ 0 ) ↔ 𝑋 = 0 )) |
| 15 | 7, 14 | bitr3d 284 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑀‘𝑋) = ∅ ↔ 𝑋 = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∅c0 4294 ‘cfv 6533 Basecbs 17265 0.cp0 18473 OPcops 39831 AtLatcal 39923 HLchlt 40009 pmapcpmap 40156 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-proset 18346 df-poset 18365 df-plt 18380 df-lub 18396 df-glb 18397 df-join 18398 df-meet 18399 df-p0 18475 df-lat 18484 df-clat 18551 df-oposet 39835 df-ol 39837 df-oml 39838 df-covers 39925 df-ats 39926 df-atl 39957 df-cvlat 39981 df-hlat 40010 df-pmap 40163 |
| This theorem is referenced by: pmapjat1 40512 |
| Copyright terms: Public domain | W3C validator |