Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfac21 Structured version   Visualization version   GIF version

Theorem dfac21 43169
Description: Tychonoff's theorem is a choice equivalent. Definition AC21 of Schechter p. 461. (Contributed by Stefan O'Rear, 22-Feb-2015.) (Revised by Mario Carneiro, 27-Aug-2015.)
Assertion
Ref Expression
dfac21 (CHOICE ↔ ∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp))

Proof of Theorem dfac21
Dummy variables 𝑔 𝑦 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3440 . . . . . . 7 𝑓 ∈ V
21dmex 7839 . . . . . 6 dom 𝑓 ∈ V
32a1i 11 . . . . 5 ((CHOICE𝑓:dom 𝑓⟶Comp) → dom 𝑓 ∈ V)
4 simpr 484 . . . . 5 ((CHOICE𝑓:dom 𝑓⟶Comp) → 𝑓:dom 𝑓⟶Comp)
5 fvex 6835 . . . . . . . 8 (∏t𝑓) ∈ V
65uniex 7674 . . . . . . 7 (∏t𝑓) ∈ V
7 acufl 23832 . . . . . . . 8 (CHOICE → UFL = V)
87adantr 480 . . . . . . 7 ((CHOICE𝑓:dom 𝑓⟶Comp) → UFL = V)
96, 8eleqtrrid 2838 . . . . . 6 ((CHOICE𝑓:dom 𝑓⟶Comp) → (∏t𝑓) ∈ UFL)
10 simpl 482 . . . . . . . 8 ((CHOICE𝑓:dom 𝑓⟶Comp) → CHOICE)
11 dfac10 10029 . . . . . . . 8 (CHOICE ↔ dom card = V)
1210, 11sylib 218 . . . . . . 7 ((CHOICE𝑓:dom 𝑓⟶Comp) → dom card = V)
136, 12eleqtrrid 2838 . . . . . 6 ((CHOICE𝑓:dom 𝑓⟶Comp) → (∏t𝑓) ∈ dom card)
149, 13elind 4147 . . . . 5 ((CHOICE𝑓:dom 𝑓⟶Comp) → (∏t𝑓) ∈ (UFL ∩ dom card))
15 eqid 2731 . . . . . 6 (∏t𝑓) = (∏t𝑓)
16 eqid 2731 . . . . . 6 (∏t𝑓) = (∏t𝑓)
1715, 16ptcmpg 23972 . . . . 5 ((dom 𝑓 ∈ V ∧ 𝑓:dom 𝑓⟶Comp ∧ (∏t𝑓) ∈ (UFL ∩ dom card)) → (∏t𝑓) ∈ Comp)
183, 4, 14, 17syl3anc 1373 . . . 4 ((CHOICE𝑓:dom 𝑓⟶Comp) → (∏t𝑓) ∈ Comp)
1918ex 412 . . 3 (CHOICE → (𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp))
2019alrimiv 1928 . 2 (CHOICE → ∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp))
21 fvex 6835 . . . . . . . . 9 (𝑔𝑦) ∈ V
22 kelac2lem 43167 . . . . . . . . 9 ((𝑔𝑦) ∈ V → (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}) ∈ Comp)
2321, 22mp1i 13 . . . . . . . 8 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ 𝑦 ∈ dom 𝑔) → (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}) ∈ Comp)
2423fmpttd 7048 . . . . . . 7 ((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})):dom 𝑔⟶Comp)
2524ffdmd 6681 . . . . . 6 ((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})):dom (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))⟶Comp)
26 vex 3440 . . . . . . . . 9 𝑔 ∈ V
2726dmex 7839 . . . . . . . 8 dom 𝑔 ∈ V
2827mptex 7157 . . . . . . 7 (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) ∈ V
29 id 22 . . . . . . . . 9 (𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) → 𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})))
30 dmeq 5842 . . . . . . . . 9 (𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) → dom 𝑓 = dom (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})))
3129, 30feq12d 6639 . . . . . . . 8 (𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) → (𝑓:dom 𝑓⟶Comp ↔ (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})):dom (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))⟶Comp))
32 fveq2 6822 . . . . . . . . 9 (𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) → (∏t𝑓) = (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))))
3332eleq1d 2816 . . . . . . . 8 (𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) → ((∏t𝑓) ∈ Comp ↔ (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp))
3431, 33imbi12d 344 . . . . . . 7 (𝑓 = (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) → ((𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp) ↔ ((𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})):dom (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))⟶Comp → (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp)))
3528, 34spcv 3555 . . . . . 6 (∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp) → ((𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})):dom (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))⟶Comp → (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp))
3625, 35syl5com 31 . . . . 5 ((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → (∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp) → (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp))
37 fvex 6835 . . . . . . . 8 (𝑔𝑥) ∈ V
3837a1i 11 . . . . . . 7 ((((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp) ∧ 𝑥 ∈ dom 𝑔) → (𝑔𝑥) ∈ V)
39 df-nel 3033 . . . . . . . . . . 11 (∅ ∉ ran 𝑔 ↔ ¬ ∅ ∈ ran 𝑔)
4039biimpi 216 . . . . . . . . . 10 (∅ ∉ ran 𝑔 → ¬ ∅ ∈ ran 𝑔)
4140ad2antlr 727 . . . . . . . . 9 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ 𝑥 ∈ dom 𝑔) → ¬ ∅ ∈ ran 𝑔)
42 fvelrn 7009 . . . . . . . . . . . 12 ((Fun 𝑔𝑥 ∈ dom 𝑔) → (𝑔𝑥) ∈ ran 𝑔)
4342adantlr 715 . . . . . . . . . . 11 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ 𝑥 ∈ dom 𝑔) → (𝑔𝑥) ∈ ran 𝑔)
44 eleq1 2819 . . . . . . . . . . 11 ((𝑔𝑥) = ∅ → ((𝑔𝑥) ∈ ran 𝑔 ↔ ∅ ∈ ran 𝑔))
4543, 44syl5ibcom 245 . . . . . . . . . 10 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ 𝑥 ∈ dom 𝑔) → ((𝑔𝑥) = ∅ → ∅ ∈ ran 𝑔))
4645necon3bd 2942 . . . . . . . . 9 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ 𝑥 ∈ dom 𝑔) → (¬ ∅ ∈ ran 𝑔 → (𝑔𝑥) ≠ ∅))
4741, 46mpd 15 . . . . . . . 8 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ 𝑥 ∈ dom 𝑔) → (𝑔𝑥) ≠ ∅)
4847adantlr 715 . . . . . . 7 ((((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp) ∧ 𝑥 ∈ dom 𝑔) → (𝑔𝑥) ≠ ∅)
49 fveq2 6822 . . . . . . . . . . . . . 14 (𝑦 = 𝑥 → (𝑔𝑦) = (𝑔𝑥))
5049unieqd 4869 . . . . . . . . . . . . . . . 16 (𝑦 = 𝑥 (𝑔𝑦) = (𝑔𝑥))
5150pweqd 4564 . . . . . . . . . . . . . . 15 (𝑦 = 𝑥 → 𝒫 (𝑔𝑦) = 𝒫 (𝑔𝑥))
5251sneqd 4585 . . . . . . . . . . . . . 14 (𝑦 = 𝑥 → {𝒫 (𝑔𝑦)} = {𝒫 (𝑔𝑥)})
5349, 52preq12d 4691 . . . . . . . . . . . . 13 (𝑦 = 𝑥 → {(𝑔𝑦), {𝒫 (𝑔𝑦)}} = {(𝑔𝑥), {𝒫 (𝑔𝑥)}})
5453fveq2d 6826 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}) = (topGen‘{(𝑔𝑥), {𝒫 (𝑔𝑥)}}))
5554cbvmptv 5193 . . . . . . . . . . 11 (𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}})) = (𝑥 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑥), {𝒫 (𝑔𝑥)}}))
5655fveq2i 6825 . . . . . . . . . 10 (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) = (∏t‘(𝑥 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑥), {𝒫 (𝑔𝑥)}})))
5756eleq1i 2822 . . . . . . . . 9 ((∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp ↔ (∏t‘(𝑥 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑥), {𝒫 (𝑔𝑥)}}))) ∈ Comp)
5857biimpi 216 . . . . . . . 8 ((∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp → (∏t‘(𝑥 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑥), {𝒫 (𝑔𝑥)}}))) ∈ Comp)
5958adantl 481 . . . . . . 7 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp) → (∏t‘(𝑥 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑥), {𝒫 (𝑔𝑥)}}))) ∈ Comp)
6038, 48, 59kelac2 43168 . . . . . 6 (((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) ∧ (∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp) → X𝑥 ∈ dom 𝑔(𝑔𝑥) ≠ ∅)
6160ex 412 . . . . 5 ((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → ((∏t‘(𝑦 ∈ dom 𝑔 ↦ (topGen‘{(𝑔𝑦), {𝒫 (𝑔𝑦)}}))) ∈ Comp → X𝑥 ∈ dom 𝑔(𝑔𝑥) ≠ ∅))
6236, 61syldc 48 . . . 4 (∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp) → ((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → X𝑥 ∈ dom 𝑔(𝑔𝑥) ≠ ∅))
6362alrimiv 1928 . . 3 (∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp) → ∀𝑔((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → X𝑥 ∈ dom 𝑔(𝑔𝑥) ≠ ∅))
64 dfac9 10028 . . 3 (CHOICE ↔ ∀𝑔((Fun 𝑔 ∧ ∅ ∉ ran 𝑔) → X𝑥 ∈ dom 𝑔(𝑔𝑥) ≠ ∅))
6563, 64sylibr 234 . 2 (∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp) → CHOICE)
6620, 65impbii 209 1 (CHOICE ↔ ∀𝑓(𝑓:dom 𝑓⟶Comp → (∏t𝑓) ∈ Comp))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1539   = wceq 1541  wcel 2111  wne 2928  wnel 3032  Vcvv 3436  cin 3896  c0 4280  𝒫 cpw 4547  {csn 4573  {cpr 4575   cuni 4856  cmpt 5170  dom cdm 5614  ran crn 5615  Fun wfun 6475  wf 6477  cfv 6481  Xcixp 8821  cardccrd 9828  CHOICEwac 10006  topGenctg 17341  tcpt 17342  Compccmp 23301  UFLcufl 23815
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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-int 4896  df-iun 4941  df-iin 4942  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-se 5568  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-isom 6490  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-rpss 7656  df-om 7797  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-1o 8385  df-2o 8386  df-oadd 8389  df-omul 8390  df-er 8622  df-map 8752  df-ixp 8822  df-en 8870  df-dom 8871  df-fin 8873  df-fi 9295  df-wdom 9451  df-dju 9794  df-card 9832  df-acn 9835  df-ac 10007  df-topgen 17347  df-pt 17348  df-fbas 21288  df-fg 21289  df-top 22809  df-topon 22826  df-bases 22861  df-cld 22934  df-ntr 22935  df-cls 22936  df-nei 23013  df-cmp 23302  df-fil 23761  df-ufil 23816  df-ufl 23817  df-flim 23854  df-fcls 23856
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator