Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > acsmap2d | Structured version Visualization version GIF version |
Description: In an algebraic closure system, if 𝑆 and 𝑇 have the same closure and 𝑆 is independent, then there is a map 𝑓 from 𝑇 into the set of finite subsets of 𝑆 such that 𝑆 equals the union of ran 𝑓. This is proven by taking the map 𝑓 from acsmapd 17178 and observing that, since 𝑆 and 𝑇 have the same closure, the closure of ∪ ran 𝑓 must contain 𝑆. Since 𝑆 is independent, by mrissmrcd 16300, ∪ ran 𝑓 must equal 𝑆. See Section II.5 in [Cohn] p. 81 to 82. (Contributed by David Moews, 1-May-2017.) |
Ref | Expression |
---|---|
acsmap2d.1 | ⊢ (𝜑 → 𝐴 ∈ (ACS‘𝑋)) |
acsmap2d.2 | ⊢ 𝑁 = (mrCls‘𝐴) |
acsmap2d.3 | ⊢ 𝐼 = (mrInd‘𝐴) |
acsmap2d.4 | ⊢ (𝜑 → 𝑆 ∈ 𝐼) |
acsmap2d.5 | ⊢ (𝜑 → 𝑇 ⊆ 𝑋) |
acsmap2d.6 | ⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇)) |
Ref | Expression |
---|---|
acsmap2d | ⊢ (𝜑 → ∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | acsmap2d.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (ACS‘𝑋)) | |
2 | acsmap2d.2 | . . 3 ⊢ 𝑁 = (mrCls‘𝐴) | |
3 | acsmap2d.3 | . . . 4 ⊢ 𝐼 = (mrInd‘𝐴) | |
4 | 1 | acsmred 16317 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋)) |
5 | acsmap2d.4 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝐼) | |
6 | 3, 4, 5 | mrissd 16296 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑋) |
7 | acsmap2d.5 | . . . . 5 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) | |
8 | 4, 2, 7 | mrcssidd 16285 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ (𝑁‘𝑇)) |
9 | acsmap2d.6 | . . . 4 ⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇)) | |
10 | 8, 9 | sseqtr4d 3642 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ (𝑁‘𝑆)) |
11 | 1, 2, 6, 10 | acsmapd 17178 | . 2 ⊢ (𝜑 → ∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) |
12 | simprl 794 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin)) | |
13 | 4 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝐴 ∈ (Moore‘𝑋)) |
14 | 5 | adantr 481 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑆 ∈ 𝐼) |
15 | 3, 13, 14 | mrissd 16296 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑆 ⊆ 𝑋) |
16 | 13, 2, 15 | mrcssidd 16285 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑆 ⊆ (𝑁‘𝑆)) |
17 | 9 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑁‘𝑆) = (𝑁‘𝑇)) |
18 | simprr 796 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑇 ⊆ (𝑁‘∪ ran 𝑓)) | |
19 | 13, 2 | mrcssvd 16283 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑁‘∪ ran 𝑓) ⊆ 𝑋) |
20 | 13, 2, 18, 19 | mrcssd 16284 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑁‘𝑇) ⊆ (𝑁‘(𝑁‘∪ ran 𝑓))) |
21 | frn 6053 | . . . . . . . . . . . . . 14 ⊢ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) → ran 𝑓 ⊆ (𝒫 𝑆 ∩ Fin)) | |
22 | 21 | unissd 4462 | . . . . . . . . . . . . 13 ⊢ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) → ∪ ran 𝑓 ⊆ ∪ (𝒫 𝑆 ∩ Fin)) |
23 | unifpw 8269 | . . . . . . . . . . . . 13 ⊢ ∪ (𝒫 𝑆 ∩ Fin) = 𝑆 | |
24 | 22, 23 | syl6sseq 3651 | . . . . . . . . . . . 12 ⊢ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) → ∪ ran 𝑓 ⊆ 𝑆) |
25 | 24 | ad2antrl 764 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → ∪ ran 𝑓 ⊆ 𝑆) |
26 | 25, 15 | sstrd 3613 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → ∪ ran 𝑓 ⊆ 𝑋) |
27 | 13, 2, 26 | mrcidmd 16286 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑁‘(𝑁‘∪ ran 𝑓)) = (𝑁‘∪ ran 𝑓)) |
28 | 20, 27 | sseqtrd 3641 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑁‘𝑇) ⊆ (𝑁‘∪ ran 𝑓)) |
29 | 17, 28 | eqsstrd 3639 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑁‘𝑆) ⊆ (𝑁‘∪ ran 𝑓)) |
30 | 16, 29 | sstrd 3613 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑆 ⊆ (𝑁‘∪ ran 𝑓)) |
31 | 13, 2, 3, 30, 25, 14 | mrissmrcd 16300 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → 𝑆 = ∪ ran 𝑓) |
32 | 12, 31 | jca 554 | . . . 4 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓))) → (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) |
33 | 32 | ex 450 | . . 3 ⊢ (𝜑 → ((𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓)) → (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓))) |
34 | 33 | eximdv 1846 | . 2 ⊢ (𝜑 → (∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑇 ⊆ (𝑁‘∪ ran 𝑓)) → ∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓))) |
35 | 11, 34 | mpd 15 | 1 ⊢ (𝜑 → ∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∃wex 1704 ∈ wcel 1990 ∩ cin 3573 ⊆ wss 3574 𝒫 cpw 4158 ∪ cuni 4436 ran crn 5115 ⟶wf 5884 ‘cfv 5888 Fincfn 7955 Moorecmre 16242 mrClscmrc 16243 mrIndcmri 16244 ACScacs 16245 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-reg 8497 ax-inf2 8538 ax-ac2 9285 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-r1 8627 df-rank 8628 df-card 8765 df-ac 8939 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-fz 12327 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-tset 15960 df-ple 15961 df-ocomp 15963 df-mre 16246 df-mrc 16247 df-mri 16248 df-acs 16249 df-preset 16928 df-drs 16929 df-poset 16946 df-ipo 17152 |
This theorem is referenced by: acsinfd 17180 acsdomd 17181 |
Copyright terms: Public domain | W3C validator |