| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dprddisj | Structured version Visualization version GIF version | ||
| Description: The function 𝑆 is a family having trivial intersections. (Contributed by Mario Carneiro, 25-Apr-2016.) |
| Ref | Expression |
|---|---|
| dprdcntz.1 | ⊢ (𝜑 → 𝐺dom DProd 𝑆) |
| dprdcntz.2 | ⊢ (𝜑 → dom 𝑆 = 𝐼) |
| dprdcntz.3 | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
| dprddisj.0 | ⊢ 0 = (0g‘𝐺) |
| dprddisj.k | ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺)) |
| Ref | Expression |
|---|---|
| dprddisj | ⊢ (𝜑 → ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6883 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑆‘𝑥) = (𝑆‘𝑋)) | |
| 2 | sneq 4594 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
| 3 | 2 | difeq2d 4074 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐼 ∖ {𝑥}) = (𝐼 ∖ {𝑋})) |
| 4 | 3 | imaeq2d 6052 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑆 “ (𝐼 ∖ {𝑥})) = (𝑆 “ (𝐼 ∖ {𝑋}))) |
| 5 | 4 | unieqd 4880 | . . . . 5 ⊢ (𝑥 = 𝑋 → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) = ∪ (𝑆 “ (𝐼 ∖ {𝑋}))) |
| 6 | 5 | fveq2d 6887 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) = (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) |
| 7 | 1, 6 | ineq12d 4167 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋}))))) |
| 8 | 7 | eqeq1d 2763 | . 2 ⊢ (𝑥 = 𝑋 → (((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 } ↔ ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) = { 0 })) |
| 9 | dprdcntz.1 | . . . . 5 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
| 10 | dprdcntz.2 | . . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
| 11 | 9, 10 | dprddomcld 20210 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ V) |
| 12 | eqid 2761 | . . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺) | |
| 13 | dprddisj.0 | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
| 14 | dprddisj.k | . . . . . . 7 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺)) | |
| 15 | 12, 13, 14 | dmdprd 20207 | . . . . . 6 ⊢ ((𝐼 ∈ V ∧ dom 𝑆 = 𝐼) → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:𝐼⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })))) |
| 16 | 11, 10, 15 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:𝐼⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })))) |
| 17 | 9, 16 | mpbid 235 | . . . 4 ⊢ (𝜑 → (𝐺 ∈ Grp ∧ 𝑆:𝐼⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }))) |
| 18 | 17 | simp3d 1162 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })) |
| 19 | simpr 490 | . . . 4 ⊢ ((∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) → ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) | |
| 20 | 19 | ralimi 3100 | . . 3 ⊢ (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) → ∀𝑥 ∈ 𝐼 ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) |
| 21 | 18, 20 | syl 18 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) |
| 22 | dprdcntz.3 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 23 | 8, 21, 22 | rspcdva 3578 | 1 ⊢ (𝜑 → ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) = { 0 }) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3077 Vcvv 3451 ∖ cdif 3896 ∩ cin 3898 ⊆ wss 3899 {csn 4584 ∪ cuni 4867 class class class wbr 5103 dom cdm 5651 “ cima 5654 ⟶wf 6533 ‘cfv 6537 0gc0g 17603 mrClscmrc 17746 Grpcgrp 19137 SubGrpcsubg 19323 Cntzccntz 19522 DProd cdprd 20202 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-oprab 7422 df-mpo 7423 df-1st 7999 df-2nd 8000 df-ixp 8919 df-dprd 20204 |
| This theorem is used by: dprdfeq0 20231 dprdres 20237 dprdss 20238 dprdf1o 20241 dprd2da 20251 dmdprdsplit2lem 20254 |
| Copyright terms: Public domain | W3C validator |