![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemeiota | Structured version Visualization version GIF version |
Description: A translation is uniquely determined by one of its values. (Contributed by NM, 18-Apr-2013.) |
Ref | Expression |
---|---|
cdlemg1c.l | ⊢ ≤ = (le‘𝐾) |
cdlemg1c.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemg1c.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemg1c.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
Ref | Expression |
---|---|
cdlemeiota | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqidd 2738 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → (𝐹‘𝑃) = (𝐹‘𝑃)) | |
2 | simp3 1139 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → 𝐹 ∈ 𝑇) | |
3 | cdlemg1c.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
4 | cdlemg1c.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | cdlemg1c.h | . . . . . . 7 ⊢ 𝐻 = (LHyp‘𝐾) | |
6 | cdlemg1c.t | . . . . . . 7 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
7 | 3, 4, 5, 6 | ltrnel 40136 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) |
8 | 7 | 3com23 1127 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) |
9 | 3, 4, 5, 6 | cdleme 40557 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → ∃!𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃)) |
10 | 8, 9 | syld3an3 1410 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → ∃!𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃)) |
11 | fveq1 6913 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑃) = (𝐹‘𝑃)) | |
12 | 11 | eqeq1d 2739 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑃) = (𝐹‘𝑃) ↔ (𝐹‘𝑃) = (𝐹‘𝑃))) |
13 | 12 | riota2 7420 | . . . 4 ⊢ ((𝐹 ∈ 𝑇 ∧ ∃!𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃)) → ((𝐹‘𝑃) = (𝐹‘𝑃) ↔ (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃)) = 𝐹)) |
14 | 2, 10, 13 | syl2anc 584 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → ((𝐹‘𝑃) = (𝐹‘𝑃) ↔ (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃)) = 𝐹)) |
15 | 1, 14 | mpbid 232 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃)) = 𝐹) |
16 | 15 | eqcomd 2743 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) → 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = (𝐹‘𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1539 ∈ wcel 2108 ∃!wreu 3378 class class class wbr 5151 ‘cfv 6569 ℩crio 7394 lecple 17314 Atomscatm 39259 HLchlt 39346 LHypclh 39981 LTrncltrn 40098 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 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 2708 ax-rep 5288 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 ax-riotaBAD 38949 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-csb 3912 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-iun 5001 df-iin 5002 df-br 5152 df-opab 5214 df-mpt 5235 df-id 5587 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-riota 7395 df-ov 7441 df-oprab 7442 df-mpo 7443 df-1st 8022 df-2nd 8023 df-undef 8306 df-map 8876 df-proset 18361 df-poset 18380 df-plt 18397 df-lub 18413 df-glb 18414 df-join 18415 df-meet 18416 df-p0 18492 df-p1 18493 df-lat 18499 df-clat 18566 df-oposet 39172 df-ol 39174 df-oml 39175 df-covers 39262 df-ats 39263 df-atl 39294 df-cvlat 39318 df-hlat 39347 df-llines 39495 df-lplanes 39496 df-lvols 39497 df-lines 39498 df-psubsp 39500 df-pmap 39501 df-padd 39793 df-lhyp 39985 df-laut 39986 df-ldil 40101 df-ltrn 40102 df-trl 40156 |
This theorem is referenced by: cdlemg1cN 40584 cdlemg1cex 40585 cdlemm10N 41115 |
Copyright terms: Public domain | W3C validator |