| 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 9257 to the map given in acsmap2d 18521. 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 18521 | . 2 ⊢ (𝜑 → ∃𝑓(𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) |
| 8 | simplrr 778 | . . . 4 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑆 = ∪ ran 𝑓) | |
| 9 | simplrl 777 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin)) | |
| 10 | inss2 4179 | . . . . . 6 ⊢ (𝒫 𝑆 ∩ Fin) ⊆ Fin | |
| 11 | fss 6685 | . . . . . 6 ⊢ ((𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ (𝒫 𝑆 ∩ Fin) ⊆ Fin) → 𝑓:𝑇⟶Fin) | |
| 12 | 9, 10, 11 | sylancl 587 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑓:𝑇⟶Fin) |
| 13 | simpr 484 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑇 ∈ Fin) | |
| 14 | 12, 13 | unirnffid 9257 | . . . 4 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → ∪ ran 𝑓 ∈ Fin) |
| 15 | 8, 14 | eqeltrd 2837 | . . 3 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → 𝑆 ∈ Fin) |
| 16 | acsinfd.7 | . . . 4 ⊢ (𝜑 → ¬ 𝑆 ∈ Fin) | |
| 17 | 16 | ad2antrr 727 | . . 3 ⊢ (((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) ∧ 𝑇 ∈ Fin) → ¬ 𝑆 ∈ Fin) |
| 18 | 15, 17 | pm2.65da 817 | . 2 ⊢ ((𝜑 ∧ (𝑓:𝑇⟶(𝒫 𝑆 ∩ Fin) ∧ 𝑆 = ∪ ran 𝑓)) → ¬ 𝑇 ∈ Fin) |
| 19 | 7, 18 | exlimddv 1937 | 1 ⊢ (𝜑 → ¬ 𝑇 ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∩ cin 3889 ⊆ wss 3890 𝒫 cpw 4542 ∪ cuni 4851 ran crn 5632 ⟶wf 6495 ‘cfv 6499 Fincfn 8893 mrClscmrc 17545 mrIndcmri 17546 ACScacs 17547 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-reg 9507 ax-inf2 9562 ax-ac2 10385 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-r1 9688 df-rank 9689 df-card 9863 df-ac 10038 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-tset 17239 df-ple 17240 df-ocomp 17241 df-mre 17548 df-mrc 17549 df-mri 17550 df-acs 17551 df-proset 18260 df-drs 18261 df-poset 18279 df-ipo 18494 |
| This theorem is referenced by: acsdomd 18523 acsinfdimd 18524 |
| Copyright terms: Public domain | W3C validator |