| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > diaelrnN | Structured version Visualization version GIF version | ||
| Description: Any value of the partial isomorphism A is a set of translations i.e. a set of vectors. (Contributed by NM, 26-Nov-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| diaelrn.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| diaelrn.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| diaelrn.i | ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| diaelrnN | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ ran 𝐼) → 𝑆 ⊆ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 2 | eqid 2737 | . . . . 5 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 3 | diaelrn.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | diaelrn.i | . . . . 5 ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) | |
| 5 | 1, 2, 3, 4 | diafn 41373 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊}) |
| 6 | fvelrnb 6895 | . . . 4 ⊢ (𝐼 Fn {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} → (𝑆 ∈ ran 𝐼 ↔ ∃𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} (𝐼‘𝑥) = 𝑆)) | |
| 7 | 5, 6 | syl 17 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ ran 𝐼 ↔ ∃𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} (𝐼‘𝑥) = 𝑆)) |
| 8 | breq1 5102 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦(le‘𝐾)𝑊 ↔ 𝑥(le‘𝐾)𝑊)) | |
| 9 | 8 | elrab 3647 | . . . . 5 ⊢ (𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} ↔ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊)) |
| 10 | diaelrn.t | . . . . . . . 8 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 11 | 1, 2, 3, 10, 4 | diass 41381 | . . . . . . 7 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊)) → (𝐼‘𝑥) ⊆ 𝑇) |
| 12 | 11 | ex 412 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) → (𝐼‘𝑥) ⊆ 𝑇)) |
| 13 | sseq1 3960 | . . . . . . 7 ⊢ ((𝐼‘𝑥) = 𝑆 → ((𝐼‘𝑥) ⊆ 𝑇 ↔ 𝑆 ⊆ 𝑇)) | |
| 14 | 13 | biimpcd 249 | . . . . . 6 ⊢ ((𝐼‘𝑥) ⊆ 𝑇 → ((𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇)) |
| 15 | 12, 14 | syl6 35 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑥(le‘𝐾)𝑊) → ((𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇))) |
| 16 | 9, 15 | biimtrid 242 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} → ((𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇))) |
| 17 | 16 | rexlimdv 3136 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (∃𝑥 ∈ {𝑦 ∈ (Base‘𝐾) ∣ 𝑦(le‘𝐾)𝑊} (𝐼‘𝑥) = 𝑆 → 𝑆 ⊆ 𝑇)) |
| 18 | 7, 17 | sylbid 240 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ ran 𝐼 → 𝑆 ⊆ 𝑇)) |
| 19 | 18 | imp 406 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ ran 𝐼) → 𝑆 ⊆ 𝑇) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 {crab 3400 ⊆ wss 3902 class class class wbr 5099 ran crn 5626 Fn wfn 6488 ‘cfv 6493 Basecbs 17141 lecple 17189 LHypclh 40323 LTrncltrn 40440 DIsoAcdia 41367 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pr 5378 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-disoa 41368 |
| This theorem is referenced by: dvadiaN 41467 djaclN 41475 djajN 41476 |
| Copyright terms: Public domain | W3C validator |