| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemftr2 | Structured version Visualization version GIF version | ||
| Description: Special case of cdlemf 41727 showing existence of non-identity translation with trace different from any 2 given lattice elements. (Contributed by NM, 25-Jul-2013.) |
| Ref | Expression |
|---|---|
| cdlemftr.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemftr.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemftr.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| cdlemftr.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| cdlemftr2 | ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemftr.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemftr.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 3 | cdlemftr.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 4 | cdlemftr.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 5 | 1, 2, 3, 4 | cdlemftr3 41729 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) ∧ ((𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌 ∧ (𝑅‘𝑓) ≠ 𝑌))) |
| 6 | simpl 488 | . . . 4 ⊢ ((𝑓 ≠ ( I ↾ 𝐵) ∧ ((𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌 ∧ (𝑅‘𝑓) ≠ 𝑌)) → 𝑓 ≠ ( I ↾ 𝐵)) | |
| 7 | simpr1 1213 | . . . 4 ⊢ ((𝑓 ≠ ( I ↾ 𝐵) ∧ ((𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌 ∧ (𝑅‘𝑓) ≠ 𝑌)) → (𝑅‘𝑓) ≠ 𝑋) | |
| 8 | simpr2 1214 | . . . 4 ⊢ ((𝑓 ≠ ( I ↾ 𝐵) ∧ ((𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌 ∧ (𝑅‘𝑓) ≠ 𝑌)) → (𝑅‘𝑓) ≠ 𝑌) | |
| 9 | 6, 7, 8 | 3jca 1146 | . . 3 ⊢ ((𝑓 ≠ ( I ↾ 𝐵) ∧ ((𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌 ∧ (𝑅‘𝑓) ≠ 𝑌)) → (𝑓 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌)) |
| 10 | 9 | reximi 3100 | . 2 ⊢ (∃𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) ∧ ((𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌 ∧ (𝑅‘𝑓) ≠ 𝑌)) → ∃𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌)) |
| 11 | 5, 10 | syl 18 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑓 ∈ 𝑇 (𝑓 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑓) ≠ 𝑋 ∧ (𝑅‘𝑓) ≠ 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 I cid 5544 ↾ cres 5652 ‘cfv 6541 Basecbs 17394 HLchlt 40514 LHypclh 41148 LTrncltrn 41265 trLctrl 41322 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-riotaBAD 40117 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-1st 8003 df-2nd 8004 df-undef 8295 df-map 8854 df-proset 18475 df-poset 18494 df-plt 18509 df-lub 18525 df-glb 18526 df-join 18527 df-meet 18528 df-p0 18604 df-p1 18605 df-lat 18613 df-clat 18680 df-oposet 40340 df-ol 40342 df-oml 40343 df-covers 40430 df-ats 40431 df-atl 40462 df-cvlat 40486 df-hlat 40515 df-llines 40662 df-lplanes 40663 df-lvols 40664 df-lines 40665 df-psubsp 40667 df-pmap 40668 df-padd 40960 df-lhyp 41152 df-laut 41153 df-ldil 41268 df-ltrn 41269 df-trl 41323 |
| This theorem is used by: cdlemftr1 41731 cdlemk26b-3 42069 cdlemk29-3 42075 cdlemk38 42079 cdlemkid5 42099 cdlemkid 42100 cdlemk55b 42124 |
| Copyright terms: Public domain | W3C validator |