Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ltrnnid | Structured version Visualization version GIF version |
Description: If a lattice translation is not the identity, then there is an atom not under the fiducial co-atom 𝑊 and not equal to its translation. (Contributed by NM, 24-May-2012.) |
Ref | Expression |
---|---|
ltrneq.b | ⊢ 𝐵 = (Base‘𝐾) |
ltrneq.l | ⊢ ≤ = (le‘𝐾) |
ltrneq.a | ⊢ 𝐴 = (Atoms‘𝐾) |
ltrneq.h | ⊢ 𝐻 = (LHyp‘𝐾) |
ltrneq.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
Ref | Expression |
---|---|
ltrnnid | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) → ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralinexa 3264 | . . . . 5 ⊢ (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → ¬ (𝐹‘𝑝) ≠ 𝑝) ↔ ¬ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝)) | |
2 | nne 3020 | . . . . . . . 8 ⊢ (¬ (𝐹‘𝑝) ≠ 𝑝 ↔ (𝐹‘𝑝) = 𝑝) | |
3 | 2 | biimpi 218 | . . . . . . 7 ⊢ (¬ (𝐹‘𝑝) ≠ 𝑝 → (𝐹‘𝑝) = 𝑝) |
4 | 3 | imim2i 16 | . . . . . 6 ⊢ ((¬ 𝑝 ≤ 𝑊 → ¬ (𝐹‘𝑝) ≠ 𝑝) → (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) |
5 | 4 | ralimi 3160 | . . . . 5 ⊢ (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → ¬ (𝐹‘𝑝) ≠ 𝑝) → ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) |
6 | 1, 5 | sylbir 237 | . . . 4 ⊢ (¬ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝) → ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) |
7 | ltrneq.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
8 | ltrneq.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
9 | ltrneq.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
10 | ltrneq.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
11 | ltrneq.t | . . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
12 | 7, 8, 9, 10, 11 | ltrnid 37286 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) ↔ 𝐹 = ( I ↾ 𝐵))) |
13 | 6, 12 | syl5ib 246 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (¬ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝) → 𝐹 = ( I ↾ 𝐵))) |
14 | 13 | necon1ad 3033 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝐹 ≠ ( I ↾ 𝐵) → ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝))) |
15 | 14 | 3impia 1113 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) → ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 class class class wbr 5066 I cid 5459 ↾ cres 5557 ‘cfv 6355 Basecbs 16483 lecple 16572 Atomscatm 36414 HLchlt 36501 LHypclh 37135 LTrncltrn 37252 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-map 8408 df-proset 17538 df-poset 17556 df-plt 17568 df-lub 17584 df-glb 17585 df-join 17586 df-meet 17587 df-p0 17649 df-lat 17656 df-clat 17718 df-oposet 36327 df-ol 36329 df-oml 36330 df-covers 36417 df-ats 36418 df-atl 36449 df-cvlat 36473 df-hlat 36502 df-laut 37140 df-ldil 37255 df-ltrn 37256 |
This theorem is referenced by: trlnidat 37324 |
Copyright terms: Public domain | W3C validator |