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 35337
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 2828 . . . . . . . . . . 11 (𝑧 = ∅ → (𝑦𝑧𝑦 ∈ ∅))
2 raleq 3294 . . . . . . . . . . 11 (𝑧 = ∅ → (∀𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦))
31, 2anbi12d 638 . . . . . . . . . 10 (𝑧 = ∅ → ((𝑦𝑧 ∧ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦) ↔ (𝑦 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦)))
43rabbidva2 3393 . . . . . . . . 9 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
54unieqd 4851 . . . . . . . 8 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
6 rab0 4314 . . . . . . . . . 10 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
76unieqi 4850 . . . . . . . . 9 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} =
8 uni0 4866 . . . . . . . . 9 ∅ = ∅
97, 8eqtri 2762 . . . . . . . 8 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
105, 9eqtrdi 2790 . . . . . . 7 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = ∅)
11 0ex 5229 . . . . . . 7 ∅ ∈ V
1210, 11eqeltrdi 2847 . . . . . 6 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
1312adantl 482 . . . . 5 ((𝑅 We V ∧ 𝑧 = ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
14 ssv 3939 . . . . . . . . . . . 12 𝑧 ⊆ V
1514jctl 528 . . . . . . . . . . 11 (𝑧 ≠ ∅ → (𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
16 vex 3435 . . . . . . . . . . 11 𝑧 ∈ V
1715, 16jctil 524 . . . . . . . . . 10 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
18 3anass 1100 . . . . . . . . . 10 ((𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅) ↔ (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
1917, 18sylibr 235 . . . . . . . . 9 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
20 wereu 5614 . . . . . . . . 9 ((𝑅 We V ∧ (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅)) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
2119, 20sylan2 599 . . . . . . . 8 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
22 vsnid 4595 . . . . . . . . . . . . 13 𝑤 ∈ {𝑤}
23 eleq2 2828 . . . . . . . . . . . . 13 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ↔ 𝑤 ∈ {𝑤}))
2422, 23mpbiri 259 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
25 elrabi 3625 . . . . . . . . . . . 12 (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} → 𝑤𝑧)
2624, 25syl 17 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤𝑧)
27 unieq 4849 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
28 unisnv 4858 . . . . . . . . . . . 12 {𝑤} = 𝑤
2927, 28eqtrdi 2790 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3026, 29jca 516 . . . . . . . . . 10 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3130eximi 1842 . . . . . . . . 9 (∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
32 reusn 4659 . . . . . . . . 9 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
33 df-rex 3064 . . . . . . . . 9 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 ↔ ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3431, 32, 333imtr4i 293 . . . . . . . 8 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3521, 34syl 17 . . . . . . 7 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
36 eleq1 2827 . . . . . . . . 9 ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 → ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧𝑤𝑧))
3736biimparc 480 . . . . . . . 8 ((𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3837rexlimiva 3132 . . . . . . 7 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3935, 38syl 17 . . . . . 6 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
4039elexd 3454 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4113, 40pm2.61dane 3021 . . . 4 (𝑅 We V → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4241ralrimivw 3135 . . 3 (𝑅 We V → ∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
43 wevgblacfn.1 . . . 4 𝐺 = (𝑧 ∈ V ↦ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4443fnmpt 6625 . . 3 (∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V → 𝐺 Fn V)
4542, 44syl 17 . 2 (𝑅 We V → 𝐺 Fn V)
4643fvmpt2 6947 . . . . . 6 ((𝑧 ∈ V ∧ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4716, 39, 46sylancr 593 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4847, 39eqeltrd 2839 . . . 4 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) ∈ 𝑧)
4948ex 413 . . 3 (𝑅 We V → (𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5049alrimiv 1934 . 2 (𝑅 We V → ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5145, 50jca 516 1 (𝑅 We V → (𝐺 Fn V ∧ ∀𝑧(𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1092  wal 1545   = wceq 1547  wex 1786  wcel 2119  wne 2934  wral 3053  wrex 3063  ∃!wreu 3342  {crab 3391  Vcvv 3431  wss 3883  c0 4261  {csn 4555   cuni 4838   class class class wbr 5072  cmpt 5153   We wwe 5570   Fn wfn 6480  cfv 6485
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-fv 6493
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator