| 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 484 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐹 = ( I ↾ 𝐵)) | |
| 2 | 1 | fveq1d 6836 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹‘𝑃) = (( I ↾ 𝐵)‘𝑃)) |
| 3 | simpl3l 1229 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝑃 ∈ 𝐴) | |
| 4 | ltrnnidn.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | ltrnnidn.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 4, 5 | atbase 39571 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
| 7 | fvresi 7119 | . . . . 5 ⊢ (𝑃 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑃) = 𝑃) | |
| 8 | 3, 6, 7 | 3syl 18 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (( I ↾ 𝐵)‘𝑃) = 𝑃) |
| 9 | 2, 8 | eqtrd 2771 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹‘𝑃) = 𝑃) |
| 10 | 9 | ex 412 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 = ( I ↾ 𝐵) → (𝐹‘𝑃) = 𝑃)) |
| 11 | simpl1 1192 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 12 | simpl2 1193 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → 𝐹 ∈ 𝑇) | |
| 13 | simpr 484 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → 𝐹 ≠ ( I ↾ 𝐵)) | |
| 14 | simpl3 1194 | . . . . 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 40456 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ≠ 𝑃) |
| 19 | 11, 12, 13, 14, 18 | syl121anc 1377 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 ≠ ( I ↾ 𝐵)) → (𝐹‘𝑃) ≠ 𝑃) |
| 20 | 19 | ex 412 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 ≠ ( I ↾ 𝐵) → (𝐹‘𝑃) ≠ 𝑃)) |
| 21 | 20 | necon4d 2956 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) = 𝑃 → 𝐹 = ( I ↾ 𝐵))) |
| 22 | 10, 21 | impbid 212 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 = ( I ↾ 𝐵) ↔ (𝐹‘𝑃) = 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 class class class wbr 5098 I cid 5518 ↾ cres 5626 ‘cfv 6492 Basecbs 17138 lecple 17186 Atomscatm 39545 HLchlt 39632 LHypclh 40266 LTrncltrn 40383 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-map 8767 df-proset 18219 df-poset 18238 df-plt 18253 df-lub 18269 df-glb 18270 df-join 18271 df-meet 18272 df-p0 18348 df-p1 18349 df-lat 18357 df-clat 18424 df-oposet 39458 df-ol 39460 df-oml 39461 df-covers 39548 df-ats 39549 df-atl 39580 df-cvlat 39604 df-hlat 39633 df-lhyp 40270 df-laut 40271 df-ldil 40386 df-ltrn 40387 df-trl 40441 |
| This theorem is referenced by: trlid0 40458 trlnidatb 40459 ltrn2ateq 40462 cdlemd8 40487 ltrniotaidvalN 40865 cdlemkid4 41216 dia2dimlem7 41352 |
| Copyright terms: Public domain | W3C validator |