Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wevgblacfn Structured version   Visualization version   GIF version

Theorem wevgblacfn 35145
Description: If 𝑅 is a well-ordering of the universe, then 𝐺 is a global choice function. Here 𝐺 maps each set 𝑧 to its minimal element with respect to 𝑅 (except when 𝑧 is the empty set, in which case it is mapped to the empty set, though this is only done for convenience). This is the ZFC version of (3 1) in https://tinyurl.com/hamkins-gblac. (Contributed by BTernaryTau, 29-Jun-2025.)
Hypothesis
Ref Expression
wevgblacfn.1 𝐺 = (𝑧 ∈ V ↦ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
Assertion
Ref Expression
wevgblacfn (𝑅 We V → (𝐺 Fn V ∧ ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧)))
Distinct variable group:   𝑥,𝑅,𝑦,𝑧
Allowed substitution hints:   𝐺(𝑥,𝑦,𝑧)

Proof of Theorem wevgblacfn
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 eleq2 2820 . . . . . . . . . . 11 (𝑧 = ∅ → (𝑦𝑧𝑦 ∈ ∅))
2 raleq 3289 . . . . . . . . . . 11 (𝑧 = ∅ → (∀𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦))
31, 2anbi12d 632 . . . . . . . . . 10 (𝑧 = ∅ → ((𝑦𝑧 ∧ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦) ↔ (𝑦 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦)))
43rabbidva2 3397 . . . . . . . . 9 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
54unieqd 4867 . . . . . . . 8 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
6 rab0 4331 . . . . . . . . . 10 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
76unieqi 4866 . . . . . . . . 9 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} =
8 uni0 4882 . . . . . . . . 9 ∅ = ∅
97, 8eqtri 2754 . . . . . . . 8 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
105, 9eqtrdi 2782 . . . . . . 7 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = ∅)
11 0ex 5240 . . . . . . 7 ∅ ∈ V
1210, 11eqeltrdi 2839 . . . . . 6 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
1312adantl 481 . . . . 5 ((𝑅 We V ∧ 𝑧 = ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
14 ssv 3954 . . . . . . . . . . . 12 𝑧 ⊆ V
1514jctl 523 . . . . . . . . . . 11 (𝑧 ≠ ∅ → (𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
16 vex 3440 . . . . . . . . . . 11 𝑧 ∈ V
1715, 16jctil 519 . . . . . . . . . 10 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
18 3anass 1094 . . . . . . . . . 10 ((𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅) ↔ (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
1917, 18sylibr 234 . . . . . . . . 9 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
20 wereu 5607 . . . . . . . . 9 ((𝑅 We V ∧ (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅)) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
2119, 20sylan2 593 . . . . . . . 8 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
22 vsnid 4611 . . . . . . . . . . . . 13 𝑤 ∈ {𝑤}
23 eleq2 2820 . . . . . . . . . . . . 13 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ↔ 𝑤 ∈ {𝑤}))
2422, 23mpbiri 258 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
25 elrabi 3638 . . . . . . . . . . . 12 (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} → 𝑤𝑧)
2624, 25syl 17 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤𝑧)
27 unieq 4865 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
28 unisnv 4874 . . . . . . . . . . . 12 {𝑤} = 𝑤
2927, 28eqtrdi 2782 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3026, 29jca 511 . . . . . . . . . 10 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3130eximi 1836 . . . . . . . . 9 (∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
32 reusn 4675 . . . . . . . . 9 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
33 df-rex 3057 . . . . . . . . 9 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 ↔ ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3431, 32, 333imtr4i 292 . . . . . . . 8 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3521, 34syl 17 . . . . . . 7 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
36 eleq1 2819 . . . . . . . . 9 ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 → ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧𝑤𝑧))
3736biimparc 479 . . . . . . . 8 ((𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3837rexlimiva 3125 . . . . . . 7 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3935, 38syl 17 . . . . . 6 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
4039elexd 3460 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4113, 40pm2.61dane 3015 . . . 4 (𝑅 We V → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4241ralrimivw 3128 . . 3 (𝑅 We V → ∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
43 wevgblacfn.1 . . . 4 𝐺 = (𝑧 ∈ V ↦ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4443fnmpt 6616 . . 3 (∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V → 𝐺 Fn V)
4542, 44syl 17 . 2 (𝑅 We V → 𝐺 Fn V)
4643fvmpt2 6935 . . . . . 6 ((𝑧 ∈ V ∧ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4716, 39, 46sylancr 587 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4847, 39eqeltrd 2831 . . . 4 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) ∈ 𝑧)
4948ex 412 . . 3 (𝑅 We V → (𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5049alrimiv 1928 . 2 (𝑅 We V → ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5145, 50jca 511 1 (𝑅 We V → (𝐺 Fn V ∧ ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1086  wal 1539   = wceq 1541  wex 1780  wcel 2111  wne 2928  wral 3047  wrex 3056  ∃!wreu 3344  {crab 3395  Vcvv 3436  wss 3897  c0 4278  {csn 4571   cuni 4854   class class class wbr 5086  cmpt 5167   We wwe 5563   Fn wfn 6471  cfv 6476
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-sep 5229  ax-nul 5239  ax-pr 5365
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-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-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-po 5519  df-so 5520  df-fr 5564  df-we 5566  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-iota 6432  df-fun 6478  df-fn 6479  df-fv 6484
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator