MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfacfin7 Structured version   Visualization version   GIF version

Theorem dfacfin7 10316
Description: Axiom of Choice equivalent: the VII-finite sets are the same as I-finite sets. (Contributed by Mario Carneiro, 18-May-2015.)
Assertion
Ref Expression
dfacfin7 (CHOICE ↔ FinVII = Fin)

Proof of Theorem dfacfin7
StepHypRef Expression
1 ssequn2 4121 . 2 ((V ∖ dom card) ⊆ Fin ↔ (Fin ∪ (V ∖ dom card)) = Fin)
2 dfac10 10055 . . . 4 (CHOICE ↔ dom card = V)
3 finnum 9867 . . . . . . 7 (𝑥 ∈ Fin → 𝑥 ∈ dom card)
43ssriv 3921 . . . . . 6 Fin ⊆ dom card
5 ssequn2 4121 . . . . . 6 (Fin ⊆ dom card ↔ (dom card ∪ Fin) = dom card)
64, 5mpbi 232 . . . . 5 (dom card ∪ Fin) = dom card
76eqeq1i 2746 . . . 4 ((dom card ∪ Fin) = V ↔ dom card = V)
82, 7bitr4i 280 . . 3 (CHOICE ↔ (dom card ∪ Fin) = V)
9 ssv 3941 . . . 4 (dom card ∪ Fin) ⊆ V
10 eqss 3932 . . . 4 ((dom card ∪ Fin) = V ↔ ((dom card ∪ Fin) ⊆ V ∧ V ⊆ (dom card ∪ Fin)))
119, 10mpbiran 716 . . 3 ((dom card ∪ Fin) = V ↔ V ⊆ (dom card ∪ Fin))
12 ssundif 4418 . . 3 (V ⊆ (dom card ∪ Fin) ↔ (V ∖ dom card) ⊆ Fin)
138, 11, 123bitri 299 . 2 (CHOICE ↔ (V ∖ dom card) ⊆ Fin)
14 dffin7-2 10315 . . 3 FinVII = (Fin ∪ (V ∖ dom card))
1514eqeq1i 2746 . 2 (FinVII = Fin ↔ (Fin ∪ (V ∖ dom card)) = Fin)
161, 13, 153bitr4i 305 1 (CHOICE ↔ FinVII = Fin)
Colors of variables: wff setvar class
Syntax hints:  wb 208   = wceq 1548  Vcvv 3433  cdif 3882  cun 3883  wss 3885  dom cdm 5621  Fincfn 8887  cardccrd 9854  CHOICEwac 10032  FinVIIcfin7 10201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-int 4881  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-se 5575  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-isom 6498  df-riota 7317  df-ov 7363  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-1o 8399  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-card 9858  df-ac 10033  df-fin7 10208
This theorem is referenced by:  fin71ac  10450
  Copyright terms: Public domain W3C validator