| 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 6878 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹‘𝑃) = (( I ↾ 𝐵)‘𝑃)) |
| 3 | simpl3l 1229 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝑃 ∈ 𝐴) | |
| 4 | ltrnnidn.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | ltrnnidn.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 4, 5 | atbase 39307 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
| 7 | fvresi 7165 | . . . . 5 ⊢ (𝑃 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑃) = 𝑃) | |
| 8 | 3, 6, 7 | 3syl 18 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ 𝐹 = ( I ↾ 𝐵)) → (( I ↾ 𝐵)‘𝑃) = 𝑃) |
| 9 | 2, 8 | eqtrd 2770 | . . 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 40193 | . . . . 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 1540 ∈ wcel 2108 ≠ wne 2932 class class class wbr 5119 I cid 5547 ↾ cres 5656 ‘cfv 6531 Basecbs 17228 lecple 17278 Atomscatm 39281 HLchlt 39368 LHypclh 40003 LTrncltrn 40120 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-map 8842 df-proset 18306 df-poset 18325 df-plt 18340 df-lub 18356 df-glb 18357 df-join 18358 df-meet 18359 df-p0 18435 df-p1 18436 df-lat 18442 df-clat 18509 df-oposet 39194 df-ol 39196 df-oml 39197 df-covers 39284 df-ats 39285 df-atl 39316 df-cvlat 39340 df-hlat 39369 df-lhyp 40007 df-laut 40008 df-ldil 40123 df-ltrn 40124 df-trl 40178 |
| This theorem is referenced by: trlid0 40195 trlnidatb 40196 ltrn2ateq 40199 cdlemd8 40224 ltrniotaidvalN 40602 cdlemkid4 40953 dia2dimlem7 41089 |
| Copyright terms: Public domain | W3C validator |