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 35490
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 2858 . . . . . . . . . . 11 (𝑧 = ∅ → (𝑦𝑧𝑦 ∈ ∅))
2 raleq 3326 . . . . . . . . . . 11 (𝑧 = ∅ → (∀𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦))
31, 2anbi12d 643 . . . . . . . . . 10 (𝑧 = ∅ → ((𝑦𝑧 ∧ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦) ↔ (𝑦 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦)))
43rabbidva2 3425 . . . . . . . . 9 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
54unieqd 4886 . . . . . . . 8 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
6 rab0 4348 . . . . . . . . . 10 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
76unieqi 4885 . . . . . . . . 9 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} =
8 uni0 4902 . . . . . . . . 9 ∅ = ∅
97, 8eqtri 2792 . . . . . . . 8 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
105, 9eqtrdi 2820 . . . . . . 7 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = ∅)
11 0ex 5269 . . . . . . 7 ∅ ∈ V
1210, 11eqeltrdi 2877 . . . . . 6 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
1312adantl 486 . . . . 5 ((𝑅 We V ∧ 𝑧 = ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
14 ssv 3969 . . . . . . . . . . . 12 𝑧 ⊆ V
1514jctl 532 . . . . . . . . . . 11 (𝑧 ≠ ∅ → (𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
16 vex 3467 . . . . . . . . . . 11 𝑧 ∈ V
1715, 16jctil 528 . . . . . . . . . 10 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
18 3anass 1109 . . . . . . . . . 10 ((𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅) ↔ (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
1917, 18sylibr 237 . . . . . . . . 9 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
20 wereu 5655 . . . . . . . . 9 ((𝑅 We V ∧ (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅)) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
2119, 20sylan2 604 . . . . . . . 8 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
22 vsnid 4631 . . . . . . . . . . . . 13 𝑤 ∈ {𝑤}
23 eleq2 2858 . . . . . . . . . . . . 13 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ↔ 𝑤 ∈ {𝑤}))
2422, 23mpbiri 261 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
25 elrabi 3655 . . . . . . . . . . . 12 (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} → 𝑤𝑧)
2624, 25syl 18 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤𝑧)
27 unieq 4884 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
28 unisnv 4893 . . . . . . . . . . . 12 {𝑤} = 𝑤
2927, 28eqtrdi 2820 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3026, 29jca 520 . . . . . . . . . 10 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3130eximi 1862 . . . . . . . . 9 (∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
32 reusn 4695 . . . . . . . . 9 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
33 df-rex 3096 . . . . . . . . 9 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 ↔ ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3431, 32, 333imtr4i 295 . . . . . . . 8 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3521, 34syl 18 . . . . . . 7 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
36 eleq1 2857 . . . . . . . . 9 ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 → ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧𝑤𝑧))
3736biimparc 484 . . . . . . . 8 ((𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3837rexlimiva 3164 . . . . . . 7 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3935, 38syl 18 . . . . . 6 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
4039elexd 3486 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4113, 40pm2.61dane 3051 . . . 4 (𝑅 We V → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4241ralrimivw 3167 . . 3 (𝑅 We V → ∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
43 wevgblacfn.1 . . . 4 𝐺 = (𝑧 ∈ V ↦ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4443fnmpt 6673 . . 3 (∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V → 𝐺 Fn V)
4542, 44syl 18 . 2 (𝑅 We V → 𝐺 Fn V)
4643fvmpt2 6999 . . . . . 6 ((𝑧 ∈ V ∧ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4716, 39, 46sylancr 598 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4847, 39eqeltrd 2869 . . . 4 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) ∈ 𝑧)
4948ex 417 . . 3 (𝑅 We V → (𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5049alrimiv 1954 . 2 (𝑅 We V → ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5145, 50jca 520 1 (𝑅 We V → (𝐺 Fn V ∧ ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1101  wal 1565   = wceq 1567  wex 1806  wcel 2149  wne 2964  wral 3085  wrex 3095  ∃!wreu 3374  {crab 3423  Vcvv 3463  wss 3913  c0 4294  {csn 4591   cuni 4873   class class class wbr 5110  cmpt 5193   We wwe 5611   Fn wfn 6529  cfv 6534
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6490  df-fun 6536  df-fn 6537  df-fv 6542
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator