Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fingch | Structured version Visualization version GIF version |
Description: A finite set is a GCH-set. (Contributed by Mario Carneiro, 15-May-2015.) |
Ref | Expression |
---|---|
fingch | ⊢ Fin ⊆ GCH |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssun1 4148 | . 2 ⊢ Fin ⊆ (Fin ∪ {𝑥 ∣ ∀𝑦 ¬ (𝑥 ≺ 𝑦 ∧ 𝑦 ≺ 𝒫 𝑥)}) | |
2 | df-gch 10043 | . 2 ⊢ GCH = (Fin ∪ {𝑥 ∣ ∀𝑦 ¬ (𝑥 ≺ 𝑦 ∧ 𝑦 ≺ 𝒫 𝑥)}) | |
3 | 1, 2 | sseqtrri 4004 | 1 ⊢ Fin ⊆ GCH |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 398 ∀wal 1535 {cab 2799 ∪ cun 3934 ⊆ wss 3936 𝒫 cpw 4539 class class class wbr 5066 ≺ csdm 8508 Fincfn 8509 GCHcgch 10042 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-un 3941 df-in 3943 df-ss 3952 df-gch 10043 |
This theorem is referenced by: gch2 10097 |
Copyright terms: Public domain | W3C validator |