| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cntzrcl | Structured version Visualization version GIF version | ||
| Description: Reverse closure for elements of the centralizer. (Contributed by Stefan O'Rear, 6-Sep-2015.) |
| Ref | Expression |
|---|---|
| cntzrcl.b | ⊢ 𝐵 = (Base‘𝑀) |
| cntzrcl.z | ⊢ 𝑍 = (Cntz‘𝑀) |
| Ref | Expression |
|---|---|
| cntzrcl | ⊢ (𝑋 ∈ (𝑍‘𝑆) → (𝑀 ∈ V ∧ 𝑆 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noel 4283 | . . . 4 ⊢ ¬ 𝑋 ∈ ∅ | |
| 2 | cntzrcl.z | . . . . . . . 8 ⊢ 𝑍 = (Cntz‘𝑀) | |
| 3 | fvprc 6877 | . . . . . . . 8 ⊢ (¬ 𝑀 ∈ V → (Cntz‘𝑀) = ∅) | |
| 4 | 2, 3 | eqtrid 2807 | . . . . . . 7 ⊢ (¬ 𝑀 ∈ V → 𝑍 = ∅) |
| 5 | 4 | fveq1d 6887 | . . . . . 6 ⊢ (¬ 𝑀 ∈ V → (𝑍‘𝑆) = (∅‘𝑆)) |
| 6 | 0fv 6926 | . . . . . 6 ⊢ (∅‘𝑆) = ∅ | |
| 7 | 5, 6 | eqtrdi 2811 | . . . . 5 ⊢ (¬ 𝑀 ∈ V → (𝑍‘𝑆) = ∅) |
| 8 | 7 | eleq2d 2846 | . . . 4 ⊢ (¬ 𝑀 ∈ V → (𝑋 ∈ (𝑍‘𝑆) ↔ 𝑋 ∈ ∅)) |
| 9 | 1, 8 | mtbiri 330 | . . 3 ⊢ (¬ 𝑀 ∈ V → ¬ 𝑋 ∈ (𝑍‘𝑆)) |
| 10 | 9 | con4i 115 | . 2 ⊢ (𝑋 ∈ (𝑍‘𝑆) → 𝑀 ∈ V) |
| 11 | cntzrcl.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑀) | |
| 12 | eqid 2760 | . . . . . . . 8 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 13 | 11, 12, 2 | cntzfval 19534 | . . . . . . 7 ⊢ (𝑀 ∈ V → 𝑍 = (𝑥 ∈ 𝒫 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝑥 (𝑦(+g‘𝑀)𝑧) = (𝑧(+g‘𝑀)𝑦)})) |
| 14 | 10, 13 | syl 18 | . . . . . 6 ⊢ (𝑋 ∈ (𝑍‘𝑆) → 𝑍 = (𝑥 ∈ 𝒫 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝑥 (𝑦(+g‘𝑀)𝑧) = (𝑧(+g‘𝑀)𝑦)})) |
| 15 | 14 | dmeqd 5886 | . . . . 5 ⊢ (𝑋 ∈ (𝑍‘𝑆) → dom 𝑍 = dom (𝑥 ∈ 𝒫 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝑥 (𝑦(+g‘𝑀)𝑧) = (𝑧(+g‘𝑀)𝑦)})) |
| 16 | eqid 2760 | . . . . . 6 ⊢ (𝑥 ∈ 𝒫 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝑥 (𝑦(+g‘𝑀)𝑧) = (𝑧(+g‘𝑀)𝑦)}) = (𝑥 ∈ 𝒫 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝑥 (𝑦(+g‘𝑀)𝑧) = (𝑧(+g‘𝑀)𝑦)}) | |
| 17 | 16 | dmmptss 6242 | . . . . 5 ⊢ dom (𝑥 ∈ 𝒫 𝐵 ↦ {𝑦 ∈ 𝐵 ∣ ∀𝑧 ∈ 𝑥 (𝑦(+g‘𝑀)𝑧) = (𝑧(+g‘𝑀)𝑦)}) ⊆ 𝒫 𝐵 |
| 18 | 15, 17 | eqsstrdi 3952 | . . . 4 ⊢ (𝑋 ∈ (𝑍‘𝑆) → dom 𝑍 ⊆ 𝒫 𝐵) |
| 19 | elfvdm 6919 | . . . 4 ⊢ (𝑋 ∈ (𝑍‘𝑆) → 𝑆 ∈ dom 𝑍) | |
| 20 | 18, 19 | sseldd 3909 | . . 3 ⊢ (𝑋 ∈ (𝑍‘𝑆) → 𝑆 ∈ 𝒫 𝐵) |
| 21 | 20 | elpwid 4565 | . 2 ⊢ (𝑋 ∈ (𝑍‘𝑆) → 𝑆 ⊆ 𝐵) |
| 22 | 10, 21 | jca 521 | 1 ⊢ (𝑋 ∈ (𝑍‘𝑆) → (𝑀 ∈ V ∧ 𝑆 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 {crab 3412 Vcvv 3450 ⊆ wss 3895 ∅c0 4278 𝒫 cpw 4556 ↦ cmpt 5185 dom cdm 5650 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 +gcplusg 17428 Cntzccntz 19529 |
| 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 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 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 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-cntz 19531 |
| This theorem is used by: cntzssv 19542 cntzi 19543 resscntz 19547 cntzmhm 19555 oppgcntz 19578 |
| Copyright terms: Public domain | W3C validator |