| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lidlunin0 | Structured version Visualization version GIF version | ||
| Description: The union of a nonempty subset of ideals in a ring is nonempty. (Contributed by AV, 28-Jun-2026.) |
| Ref | Expression |
|---|---|
| lidlunin0 | ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ≠ ∅ ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → ∪ 𝐶 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4303 | . . . . . . 7 ⊢ (𝐶 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐶) | |
| 2 | simpl 488 | . . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → 𝑅 ∈ Ring) | |
| 3 | ssel 3928 | . . . . . . . . . . . . 13 ⊢ (𝐶 ⊆ (LIdeal‘𝑅) → (𝑦 ∈ 𝐶 → 𝑦 ∈ (LIdeal‘𝑅))) | |
| 4 | 3 | adantl 487 | . . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → (𝑦 ∈ 𝐶 → 𝑦 ∈ (LIdeal‘𝑅))) |
| 5 | 4 | imp 412 | . . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) ∧ 𝑦 ∈ 𝐶) → 𝑦 ∈ (LIdeal‘𝑅)) |
| 6 | eqid 2762 | . . . . . . . . . . . 12 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅) | |
| 7 | eqid 2762 | . . . . . . . . . . . 12 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 8 | 6, 7 | lidl0cl 21412 | . . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ (LIdeal‘𝑅)) → (0g‘𝑅) ∈ 𝑦) |
| 9 | 2, 5, 8 | syl2an2r 698 | . . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) ∧ 𝑦 ∈ 𝐶) → (0g‘𝑅) ∈ 𝑦) |
| 10 | simpr 490 | . . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) ∧ 𝑦 ∈ 𝐶) → 𝑦 ∈ 𝐶) | |
| 11 | 9, 10 | jca 521 | . . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) ∧ 𝑦 ∈ 𝐶) → ((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶)) |
| 12 | 11 | ex 418 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → (𝑦 ∈ 𝐶 → ((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶))) |
| 13 | 12 | eximdv 1950 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → (∃𝑦 𝑦 ∈ 𝐶 → ∃𝑦((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶))) |
| 14 | 1, 13 | biimtrid 245 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → (𝐶 ≠ ∅ → ∃𝑦((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶))) |
| 15 | 14 | ex 418 | . . . . 5 ⊢ (𝑅 ∈ Ring → (𝐶 ⊆ (LIdeal‘𝑅) → (𝐶 ≠ ∅ → ∃𝑦((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶)))) |
| 16 | 15 | com23 87 | . . . 4 ⊢ (𝑅 ∈ Ring → (𝐶 ≠ ∅ → (𝐶 ⊆ (LIdeal‘𝑅) → ∃𝑦((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶)))) |
| 17 | 16 | 3imp 1128 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ≠ ∅ ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → ∃𝑦((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶)) |
| 18 | eluni 4873 | . . 3 ⊢ ((0g‘𝑅) ∈ ∪ 𝐶 ↔ ∃𝑦((0g‘𝑅) ∈ 𝑦 ∧ 𝑦 ∈ 𝐶)) | |
| 19 | 17, 18 | sylibr 237 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ≠ ∅ ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → (0g‘𝑅) ∈ ∪ 𝐶) |
| 20 | 19 | ne0d 4291 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝐶 ≠ ∅ ∧ 𝐶 ⊆ (LIdeal‘𝑅)) → ∪ 𝐶 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∃wex 1812 ∈ wcel 2145 ≠ wne 2957 ⊆ wss 3902 ∅c0 4282 ∪ cuni 4870 ‘cfv 6537 0gc0g 17528 Ringcrg 20376 LIdealclidl 21397 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 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-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 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-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-mulr 17360 df-sca 17362 df-vsca 17363 df-ip 17364 df-0g 17530 df-mgm 18734 df-sgrp 18825 df-mnd 18841 df-grp 19064 df-minusg 19065 df-sbg 19066 df-subg 19250 df-mgp 20278 df-ur 20325 df-ring 20378 df-subrg 20736 df-lmod 21050 df-lss 21120 df-sra 21361 df-rgmod 21362 df-lidl 21399 |
| This theorem is used by: unichnlidl 21429 |
| Copyright terms: Public domain | W3C validator |