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 35595
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 2852 . . . . . . . . . . 11 (𝑧 = ∅ → (𝑦𝑧𝑦 ∈ ∅))
2 raleq 3320 . . . . . . . . . . 11 (𝑧 = ∅ → (∀𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦))
31, 2anbi12d 643 . . . . . . . . . 10 (𝑧 = ∅ → ((𝑦𝑧 ∧ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦) ↔ (𝑦 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦)))
43rabbidva2 3418 . . . . . . . . 9 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
54unieqd 4885 . . . . . . . 8 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦})
6 rab0 4342 . . . . . . . . . 10 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
76unieqi 4884 . . . . . . . . 9 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} =
8 uni0 4901 . . . . . . . . 9 ∅ = ∅
97, 8eqtri 2786 . . . . . . . 8 {𝑦 ∈ ∅ ∣ ∀𝑥 ∈ ∅ ¬ 𝑥𝑅𝑦} = ∅
105, 9eqtrdi 2814 . . . . . . 7 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = ∅)
11 0ex 5270 . . . . . . 7 ∅ ∈ V
1210, 11eqeltrdi 2871 . . . . . 6 (𝑧 = ∅ → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
1312adantl 486 . . . . 5 ((𝑅 We V ∧ 𝑧 = ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
14 ssv 3961 . . . . . . . . . . . 12 𝑧 ⊆ V
1514jctl 532 . . . . . . . . . . 11 (𝑧 ≠ ∅ → (𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
16 vex 3459 . . . . . . . . . . 11 𝑧 ∈ V
1715, 16jctil 528 . . . . . . . . . 10 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
18 3anass 1111 . . . . . . . . . 10 ((𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅) ↔ (𝑧 ∈ V ∧ (𝑧 ⊆ V ∧ 𝑧 ≠ ∅)))
1917, 18sylibr 237 . . . . . . . . 9 (𝑧 ≠ ∅ → (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅))
20 wereu 5657 . . . . . . . . 9 ((𝑅 We V ∧ (𝑧 ∈ V ∧ 𝑧 ⊆ V ∧ 𝑧 ≠ ∅)) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
2119, 20sylan2 604 . . . . . . . 8 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦)
22 vsnid 4629 . . . . . . . . . . . . 13 𝑤 ∈ {𝑤}
23 eleq2 2852 . . . . . . . . . . . . 13 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ↔ 𝑤 ∈ {𝑤}))
2422, 23mpbiri 261 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
25 elrabi 3646 . . . . . . . . . . . 12 (𝑤 ∈ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} → 𝑤𝑧)
2624, 25syl 18 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → 𝑤𝑧)
27 unieq 4883 . . . . . . . . . . . 12 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
28 unisnv 4892 . . . . . . . . . . . 12 {𝑤} = 𝑤
2927, 28eqtrdi 2814 . . . . . . . . . . 11 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3026, 29jca 520 . . . . . . . . . 10 ({𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → (𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3130eximi 1865 . . . . . . . . 9 (∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤} → ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
32 reusn 4693 . . . . . . . . 9 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 ↔ ∃𝑤{𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = {𝑤})
33 df-rex 3090 . . . . . . . . 9 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 ↔ ∃𝑤(𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤))
3431, 32, 333imtr4i 295 . . . . . . . 8 (∃!𝑦𝑧𝑥𝑧 ¬ 𝑥𝑅𝑦 → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
3521, 34syl 18 . . . . . . 7 ((𝑅 We V ∧ 𝑧 ≠ ∅) → ∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤)
36 eleq1 2851 . . . . . . . . 9 ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 → ( {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧𝑤𝑧))
3736biimparc 484 . . . . . . . 8 ((𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3837rexlimiva 3158 . . . . . . 7 (∃𝑤𝑧 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} = 𝑤 {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
3935, 38syl 18 . . . . . 6 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧)
4039elexd 3478 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4113, 40pm2.61dane 3045 . . . 4 (𝑅 We V → {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
4241ralrimivw 3161 . . 3 (𝑅 We V → ∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V)
43 wevgblacfn.1 . . . 4 𝐺 = (𝑧 ∈ V ↦ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4443fnmpt 6675 . . 3 (∀𝑧 ∈ V {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ V → 𝐺 Fn V)
4542, 44syl 18 . 2 (𝑅 We V → 𝐺 Fn V)
4643fvmpt2 7001 . . . . . 6 ((𝑧 ∈ V ∧ {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦} ∈ 𝑧) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4716, 39, 46sylancr 598 . . . . 5 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) = {𝑦𝑧 ∣ ∀𝑥𝑧 ¬ 𝑥𝑅𝑦})
4847, 39eqeltrd 2863 . . . 4 ((𝑅 We V ∧ 𝑧 ≠ ∅) → (𝐺𝑧) ∈ 𝑧)
4948ex 417 . . 3 (𝑅 We V → (𝑧 ≠ ∅ → (𝐺𝑧) ∈ 𝑧))
5049alrimiv 1957 . 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 1103  wal 1568   = wceq 1570  wex 1809  wcel 2143  wne 2958  wral 3079  wrex 3089  ∃!wreu 3367  {crab 3416  Vcvv 3455  wss 3905  c0 4286  {csn 4589   cuni 4872   class class class wbr 5109  cmpt 5192   We wwe 5613   Fn wfn 6531  cfv 6536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator