| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isdilN | Structured version Visualization version GIF version | ||
| Description: The predicate "is a dilation". (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dilset.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dilset.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
| dilset.w | ⊢ 𝑊 = (WAtoms‘𝐾) |
| dilset.m | ⊢ 𝑀 = (PAut‘𝐾) |
| dilset.l | ⊢ 𝐿 = (Dil‘𝐾) |
| Ref | Expression |
|---|---|
| isdilN | ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝐿‘𝐷) ↔ (𝐹 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dilset.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 2 | dilset.s | . . . 4 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 3 | dilset.w | . . . 4 ⊢ 𝑊 = (WAtoms‘𝐾) | |
| 4 | dilset.m | . . . 4 ⊢ 𝑀 = (PAut‘𝐾) | |
| 5 | dilset.l | . . . 4 ⊢ 𝐿 = (Dil‘𝐾) | |
| 6 | 1, 2, 3, 4, 5 | dilsetN 41013 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐿‘𝐷) = {𝑓 ∈ 𝑀 ∣ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥)}) |
| 7 | 6 | eleq2d 2848 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝐿‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ 𝑀 ∣ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥)})) |
| 8 | fveq1 6881 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 9 | 8 | eqeq1d 2764 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) = 𝑥 ↔ (𝐹‘𝑥) = 𝑥)) |
| 10 | 9 | imbi2d 343 | . . . 4 ⊢ (𝑓 = 𝐹 → ((𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥) ↔ (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥))) |
| 11 | 10 | ralbidv 3187 | . . 3 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥) ↔ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥))) |
| 12 | 11 | elrab 3648 | . 2 ⊢ (𝐹 ∈ {𝑓 ∈ 𝑀 ∣ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝑓‘𝑥) = 𝑥)} ↔ (𝐹 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥))) |
| 13 | 7, 12 | bitrdi 290 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝐿‘𝐷) ↔ (𝐹 ∈ 𝑀 ∧ ∀𝑥 ∈ 𝑆 (𝑥 ⊆ (𝑊‘𝐷) → (𝐹‘𝑥) = 𝑥)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 {crab 3414 ⊆ wss 3902 ‘cfv 6537 Atomscatm 40123 PSubSpcpsubsp 40356 WAtomscwpointsN 40846 PAutcpautN 40847 DilcdilN 40962 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-dilN 40966 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |