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

Theorem dfacfin7 10313
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 4142 . 2 ((V ∖ dom card) ⊆ Fin ↔ (Fin ∪ (V ∖ dom card)) = Fin)
2 dfac10 10052 . . . 4 (CHOICE ↔ dom card = V)
3 finnum 9864 . . . . . . 7 (𝑥 ∈ Fin → 𝑥 ∈ dom card)
43ssriv 3938 . . . . . 6 Fin ⊆ dom card
5 ssequn2 4142 . . . . . 6 (Fin ⊆ dom card ↔ (dom card ∪ Fin) = dom card)
64, 5mpbi 230 . . . . 5 (dom card ∪ Fin) = dom card
76eqeq1i 2742 . . . 4 ((dom card ∪ Fin) = V ↔ dom card = V)
82, 7bitr4i 278 . . 3 (CHOICE ↔ (dom card ∪ Fin) = V)
9 ssv 3959 . . . 4 (dom card ∪ Fin) ⊆ V
10 eqss 3950 . . . 4 ((dom card ∪ Fin) = V ↔ ((dom card ∪ Fin) ⊆ V ∧ V ⊆ (dom card ∪ Fin)))
119, 10mpbiran 710 . . 3 ((dom card ∪ Fin) = V ↔ V ⊆ (dom card ∪ Fin))
12 ssundif 4441 . . 3 (V ⊆ (dom card ∪ Fin) ↔ (V ∖ dom card) ⊆ Fin)
138, 11, 123bitri 297 . 2 (CHOICE ↔ (V ∖ dom card) ⊆ Fin)
14 dffin7-2 10312 . . 3 FinVII = (Fin ∪ (V ∖ dom card))
1514eqeq1i 2742 . 2 (FinVII = Fin ↔ (Fin ∪ (V ∖ dom card)) = Fin)
161, 13, 153bitr4i 303 1 (CHOICE ↔ FinVII = Fin)
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1542  Vcvv 3441  cdif 3899  cun 3900  wss 3902  dom cdm 5625  Fincfn 8887  cardccrd 9851  CHOICEwac 10029  FinVIIcfin7 10198
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  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 9855  df-ac 10030  df-fin7 10205
This theorem is referenced by:  fin71ac  10447
  Copyright terms: Public domain W3C validator