![]() |
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 3104 | . . . . 5 ⊢ (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → ¬ (𝐹‘𝑝) ≠ 𝑝) ↔ ¬ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝)) | |
2 | nne 2947 | . . . . . . . 8 ⊢ (¬ (𝐹‘𝑝) ≠ 𝑝 ↔ (𝐹‘𝑝) = 𝑝) | |
3 | 2 | biimpi 215 | . . . . . . 7 ⊢ (¬ (𝐹‘𝑝) ≠ 𝑝 → (𝐹‘𝑝) = 𝑝) |
4 | 3 | imim2i 16 | . . . . . 6 ⊢ ((¬ 𝑝 ≤ 𝑊 → ¬ (𝐹‘𝑝) ≠ 𝑝) → (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) |
5 | 4 | ralimi 3086 | . . . . 5 ⊢ (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → ¬ (𝐹‘𝑝) ≠ 𝑝) → ∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝)) |
6 | 1, 5 | sylbir 234 | . . . 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 38589 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (∀𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 → (𝐹‘𝑝) = 𝑝) ↔ 𝐹 = ( I ↾ 𝐵))) |
13 | 6, 12 | imbitrid 243 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (¬ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝) → 𝐹 = ( I ↾ 𝐵))) |
14 | 13 | necon1ad 2960 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝐹 ≠ ( I ↾ 𝐵) → ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝))) |
15 | 14 | 3impia 1117 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) → ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ (𝐹‘𝑝) ≠ 𝑝)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3073 class class class wbr 5105 I cid 5530 ↾ cres 5635 ‘cfv 6496 Basecbs 17082 lecple 17139 Atomscatm 37716 HLchlt 37803 LHypclh 38438 LTrncltrn 38555 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-map 8766 df-proset 18183 df-poset 18201 df-plt 18218 df-lub 18234 df-glb 18235 df-join 18236 df-meet 18237 df-p0 18313 df-lat 18320 df-clat 18387 df-oposet 37629 df-ol 37631 df-oml 37632 df-covers 37719 df-ats 37720 df-atl 37751 df-cvlat 37775 df-hlat 37804 df-laut 38443 df-ldil 38558 df-ltrn 38559 |
This theorem is referenced by: trlnidat 38627 |
Copyright terms: Public domain | W3C validator |