| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ltrnideq | Structured version Visualization version GIF version | ||
| Description: Property of the identity lattice translation. (Contributed by NM, 27-May-2012.) |
| Ref | Expression |
|---|---|
| ltrnnidn.b | ⊢ 𝐵 = (Base‘𝐾) |
| ltrnnidn.l | ⊢ ≤ = (le‘𝐾) |
| ltrnnidn.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| ltrnnidn.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| ltrnnidn.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| ltrnideq | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 = ( I ↾ 𝐵) ↔ (𝐹‘𝑃) = 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐹 = ( I ↾ 𝐵)) | |
| 2 | 1 | fveq1d 6887 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹‘𝑃) = (( I ↾ 𝐵)‘𝑃)) |
| 3 | simpl3l 1247 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝑃 ∈ 𝐴) | |
| 4 | ltrnnidn.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | ltrnnidn.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 4, 5 | atbase 40125 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
| 7 | fvresi 7177 | . . . . 5 ⊢ (𝑃 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑃) = 𝑃) | |
| 8 | 3, 6, 7 | 3syl 19 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (( I ↾ 𝐵)‘𝑃) = 𝑃) |
| 9 | 2, 8 | eqtrd 2800 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹‘𝑃) = 𝑃) |
| 10 | 9 | ex 418 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 = ( I ↾ 𝐵) → (𝐹‘𝑃) = 𝑃)) |
| 11 | simpl1 1210 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 12 | simpl2 1211 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → 𝐹 ∈ 𝑇) | |
| 13 | simpr 490 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → 𝐹 ≠ ( I ↾ 𝐵)) | |
| 14 | simpl3 1212 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 15 | ltrnnidn.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
| 16 | ltrnnidn.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 17 | ltrnnidn.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 18 | 4, 15, 5, 16, 17 | ltrnnidn 41010 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ≠ 𝑃) |
| 19 | 11, 12, 13, 14, 18 | syl121anc 1402 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → (𝐹‘𝑃) ≠ 𝑃) |
| 20 | 19 | ex 418 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 ≠ ( I ↾ 𝐵) → (𝐹‘𝑃) ≠ 𝑃)) |
| 21 | 20 | necon4d 2984 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) = 𝑃 → 𝐹 = ( I ↾ 𝐵))) |
| 22 | 10, 21 | impbid 215 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 = ( I ↾ 𝐵) ↔ (𝐹‘𝑃) = 𝑃)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 class class class wbr 5111 I cid 5557 ↾ cres 5665 ‘cfv 6540 Basecbs 17295 lecple 17343 Atomscatm 40099 HLchlt 40186 LHypclh 40820 LTrncltrn 40937 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-map 8832 df-proset 18376 df-poset 18395 df-plt 18410 df-lub 18426 df-glb 18427 df-join 18428 df-meet 18429 df-p0 18505 df-p1 18506 df-lat 18514 df-clat 18581 df-oposet 40012 df-ol 40014 df-oml 40015 df-covers 40102 df-ats 40103 df-atl 40134 df-cvlat 40158 df-hlat 40187 df-lhyp 40824 df-laut 40825 df-ldil 40940 df-ltrn 40941 df-trl 40995 |
| This theorem is used by: trlid0 41012 trlnidatb 41013 ltrn2ateq 41016 cdlemd8 41041 ltrniotaidvalN 41419 cdlemkid4 41770 dia2dimlem7 41906 |
| Copyright terms: Public domain | W3C validator |