| 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 6881 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑆‘𝑥) = (𝑆‘𝑋)) | |
| 2 | sneq 4616 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
| 3 | 2 | difeq2d 4106 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐼 ∖ {𝑥}) = (𝐼 ∖ {𝑋})) |
| 4 | 3 | imaeq2d 6052 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑆 “ (𝐼 ∖ {𝑥})) = (𝑆 “ (𝐼 ∖ {𝑋}))) |
| 5 | 4 | unieqd 4901 | . . . . 5 ⊢ (𝑥 = 𝑋 → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) = ∪ (𝑆 “ (𝐼 ∖ {𝑋}))) |
| 6 | 5 | fveq2d 6885 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) = (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) |
| 7 | 1, 6 | ineq12d 4201 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋}))))) |
| 8 | 7 | eqeq1d 2738 | . 2 ⊢ (𝑥 = 𝑋 → (((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 } ↔ ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) = { 0 })) |
| 9 | dprdcntz.1 | . . . . 5 ⊢ (𝜑 → 𝐺dom DProd 𝑆) | |
| 10 | dprdcntz.2 | . . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐼) | |
| 11 | 9, 10 | dprddomcld 19989 | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ V) |
| 12 | eqid 2736 | . . . . . . 7 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺) | |
| 13 | dprddisj.0 | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
| 14 | dprddisj.k | . . . . . . 7 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺)) | |
| 15 | 12, 13, 14 | dmdprd 19986 | . . . . . 6 ⊢ ((𝐼 ∈ V ∧ dom 𝑆 = 𝐼) → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:𝐼⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })))) |
| 16 | 11, 10, 15 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → (𝐺dom DProd 𝑆 ↔ (𝐺 ∈ Grp ∧ 𝑆:𝐼⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })))) |
| 17 | 9, 16 | mpbid 232 | . . . 4 ⊢ (𝜑 → (𝐺 ∈ Grp ∧ 𝑆:𝐼⟶(SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }))) |
| 18 | 17 | simp3d 1144 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })) |
| 19 | simpr 484 | . . . 4 ⊢ ((∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) → ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) | |
| 20 | 19 | ralimi 3074 | . . 3 ⊢ (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ (𝐼 ∖ {𝑥})(𝑆‘𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆‘𝑦)) ∧ ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) → ∀𝑥 ∈ 𝐼 ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) |
| 21 | 18, 20 | syl 17 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝑆‘𝑥) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 }) |
| 22 | dprdcntz.3 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 23 | 8, 21, 22 | rspcdva 3607 | 1 ⊢ (𝜑 → ((𝑆‘𝑋) ∩ (𝐾‘∪ (𝑆 “ (𝐼 ∖ {𝑋})))) = { 0 }) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3052 Vcvv 3464 ∖ cdif 3928 ∩ cin 3930 ⊆ wss 3931 {csn 4606 ∪ cuni 4888 class class class wbr 5124 dom cdm 5659 “ cima 5662 ⟶wf 6532 ‘cfv 6536 0gc0g 17458 mrClscmrc 17600 Grpcgrp 18921 SubGrpcsubg 19108 Cntzccntz 19303 DProd cdprd 19981 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 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 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-oprab 7414 df-mpo 7415 df-1st 7993 df-2nd 7994 df-ixp 8917 df-dprd 19983 |
| This theorem is referenced by: dprdfeq0 20010 dprdres 20016 dprdss 20017 dprdf1o 20020 dprd2da 20030 dmdprdsplit2lem 20033 |
| Copyright terms: Public domain | W3C validator |