| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfacfin7 | Structured version Visualization version GIF version | ||
| Description: Axiom of Choice equivalent: the VII-finite sets are the same as I-finite sets. (Contributed by Mario Carneiro, 18-May-2015.) |
| Ref | Expression |
|---|---|
| dfacfin7 | ⊢ (CHOICE ↔ FinVII = Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssequn2 4141 | . 2 ⊢ ((V ∖ dom card) ⊆ Fin ↔ (Fin ∪ (V ∖ dom card)) = Fin) | |
| 2 | dfac10 10128 | . . . 4 ⊢ (CHOICE ↔ dom card = V) | |
| 3 | finnum 9941 | . . . . . . 7 ⊢ (𝑥 ∈ Fin → 𝑥 ∈ dom card) | |
| 4 | 3 | ssriv 3940 | . . . . . 6 ⊢ Fin ⊆ dom card |
| 5 | ssequn2 4141 | . . . . . 6 ⊢ (Fin ⊆ dom card ↔ (dom card ∪ Fin) = dom card) | |
| 6 | 4, 5 | mpbi 233 | . . . . 5 ⊢ (dom card ∪ Fin) = dom card |
| 7 | 6 | eqeq1i 2767 | . . . 4 ⊢ ((dom card ∪ Fin) = V ↔ dom card = V) |
| 8 | 2, 7 | bitr4i 281 | . . 3 ⊢ (CHOICE ↔ (dom card ∪ Fin) = V) |
| 9 | ssv 3960 | . . . 4 ⊢ (dom card ∪ Fin) ⊆ V | |
| 10 | eqss 3951 | . . . 4 ⊢ ((dom card ∪ Fin) = V ↔ ((dom card ∪ Fin) ⊆ V ∧ V ⊆ (dom card ∪ Fin))) | |
| 11 | 9, 10 | mpbiran 721 | . . 3 ⊢ ((dom card ∪ Fin) = V ↔ V ⊆ (dom card ∪ Fin)) |
| 12 | ssundif 4447 | . . 3 ⊢ (V ⊆ (dom card ∪ Fin) ↔ (V ∖ dom card) ⊆ Fin) | |
| 13 | 8, 11, 12 | 3bitri 300 | . 2 ⊢ (CHOICE ↔ (V ∖ dom card) ⊆ Fin) |
| 14 | dffin7-2 10388 | . . 3 ⊢ FinVII = (Fin ∪ (V ∖ dom card)) | |
| 15 | 14 | eqeq1i 2767 | . 2 ⊢ (FinVII = Fin ↔ (Fin ∪ (V ∖ dom card)) = Fin) |
| 16 | 1, 13, 15 | 3bitr4i 306 | 1 ⊢ (CHOICE ↔ FinVII = Fin) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 Vcvv 3454 ∖ cdif 3901 ∪ cun 3902 ⊆ wss 3904 dom cdm 5660 Fincfn 8941 cardccrd 9928 CHOICEwac 10106 FinVIIcfin7 10274 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7369 df-ov 7415 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-1o 8451 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-card 9932 df-ac 10107 df-fin7 10281 |
| This theorem is used by: fin71ac 10523 |
| Copyright terms: Public domain | W3C validator |