| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > acsinfd | Structured version Visualization version GIF version | ||
| Description: In an algebraic closure system, if 𝑆 and 𝑇 have the same closure and 𝑆 is infinite independent, then 𝑇 is infinite. This follows from applying unirnffid 9292 to the map given in acsmap2d 18601. 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 | ⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇)) |
| acsinfd.7 | ⊢ (𝜑 → ¬ 𝑆 ∈ Fin) |
| Ref | Expression |
|---|---|
| acsinfd | ⊢ (𝜑 → ¬ 𝑇 ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | acsmap2d.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (ACS‘𝑋)) | |
| 2 | acsmap2d.2 | . . 3 ⊢ 𝑁 = (mrCls‘𝐴) | |
| 3 | acsmap2d.3 | . . 3 ⊢ 𝐼 = (mrInd‘𝐴) | |
| 4 | acsmap2d.4 | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝐼) | |
| 5 | acsmap2d.5 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ 𝑋) | |
| 6 | acsmap2d.6 | . . 3 ⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇)) | |
| 7 | 1, 2, 3, 4, 5, 6 | acsmap2d 18601 | . 2 ⊢ (𝜑 → ∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) |
| 8 | simplrr 789 | . . . 4 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑆 = ∪ ran 𝑓) | |
| 9 | simplrl 788 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin)) | |
| 10 | inss2 4192 | . . . . . 6 ⊢ (𝒫 𝑆 ∩ Fin) ⊆ Fin | |
| 11 | fss 6712 | . . . . . 6 ⊢ ((𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ (𝒫 𝑆 ∩ Fin) ⊆ Fin) → 𝑓:𝑇⟶Fin) | |
| 12 | 9, 10, 11 | sylancl 597 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑓:𝑇⟶Fin) |
| 13 | simpr 489 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑇 ∈ Fin) | |
| 14 | 12, 13 | unirnffid 9292 | . . . 4 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → ∪ ran 𝑓 ∈ Fin) |
| 15 | 8, 14 | eqeltrd 2865 | . . 3 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑆 ∈ Fin) |
| 16 | acsinfd.7 | . . . 4 ⊢ (𝜑 → ¬ 𝑆 ∈ Fin) | |
| 17 | 16 | ad2antrr 738 | . . 3 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → ¬ 𝑆 ∈ Fin) |
| 18 | 15, 17 | pm2.65da 828 | . 2 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) → ¬ 𝑇 ∈ Fin) |
| 19 | 7, 18 | exlimddv 1958 | 1 ⊢ (𝜑 → ¬ 𝑇 ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∩ cin 3906 ⊆ wss 3907 𝒫 cpw 4558 ∪ cuni 4868 ran crn 5653 ⟶wf 6521 ‘cfv 6525 Fincfn 8931 mrClscmrc 17625 mrIndcmri 17626 ACScacs 17627 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-reg 9542 ax-inf2 9598 ax-ac2 10435 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-iin 4955 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-r1 9724 df-rank 9725 df-card 9913 df-ac 10088 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-z 12583 df-dec 12703 df-uz 12854 df-fz 13527 df-struct 17197 df-slot 17232 df-ndx 17244 df-base 17260 df-tset 17319 df-ple 17320 df-ocomp 17321 df-mre 17628 df-mrc 17629 df-mri 17630 df-acs 17631 df-proset 18340 df-drs 18341 df-poset 18359 df-ipo 18574 |
| This theorem is referenced by: acsdomd 18603 acsinfdimd 18604 |
| Copyright terms: Public domain | W3C validator |