| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unifi3 | Structured version Visualization version GIF version | ||
| Description: If a union is finite, then all its elements are finite. See unifi 9303. (Contributed by Thierry Arnoux, 27-Aug-2017.) |
| Ref | Expression |
|---|---|
| unifi3 | ⊢ (∪ 𝐴 ∈ Fin → 𝐴 ⊆ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elssuni 4907 | . . 3 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ⊆ ∪ 𝐴) | |
| 2 | ssfi 9159 | . . . 4 ⊢ ((∪ 𝐴 ∈ Fin ∧ 𝑥 ⊆ ∪ 𝐴) → 𝑥 ∈ Fin) | |
| 3 | 2 | ex 418 | . . 3 ⊢ (∪ 𝐴 ∈ Fin → (𝑥 ⊆ ∪ 𝐴 → 𝑥 ∈ Fin)) |
| 4 | 1, 3 | syl5 35 | . 2 ⊢ (∪ 𝐴 ∈ Fin → (𝑥 ∈ 𝐴 → 𝑥 ∈ Fin)) |
| 5 | 4 | ssrdv 3946 | 1 ⊢ (∪ 𝐴 ∈ Fin → 𝐴 ⊆ Fin) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2146 ⊆ wss 3908 ∪ cuni 4875 Fincfn 8945 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5260 ax-nul 5272 ax-pr 5407 ax-un 7738 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4876 df-br 5113 df-opab 5177 df-tr 5222 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-om 7865 df-1o 8455 df-en 8946 df-fin 8949 |
| This theorem is used by: oldfib 28585 fpwrelmapffslem 33092 |
| Copyright terms: Public domain | W3C validator |