![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > unfid | Structured version Visualization version GIF version |
Description: The union of two finite sets is finite. (Contributed by Glauco Siliprandi, 5-Feb-2022.) |
Ref | Expression |
---|---|
unfid.1 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
unfid.2 | ⊢ (𝜑 → 𝐵 ∈ Fin) |
Ref | Expression |
---|---|
unfid | ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ Fin) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unfid.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
2 | unfid.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ Fin) | |
3 | unfi 9219 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴 ∪ 𝐵) ∈ Fin) | |
4 | 1, 2, 3 | syl2anc 584 | 1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2108 ∪ cun 3964 Fincfn 8993 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pr 5441 ax-un 7761 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-pss 3986 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-br 5152 df-opab 5214 df-tr 5269 df-id 5587 df-eprel 5593 df-po 5601 df-so 5602 df-fr 5645 df-we 5647 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-ord 6395 df-on 6396 df-lim 6397 df-suc 6398 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-om 7895 df-en 8994 df-fin 8997 |
This theorem is referenced by: constrfin 33783 cnrefiisplem 45813 |
Copyright terms: Public domain | W3C validator |