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

Theorem vonf1osev 35959
Description: If 𝐹 is a bijection from the universe to the ordinals, then 𝑅 is a set-like well-ordering of the universe. This is the ZFC version of (2 → 4) which can be used in place of (3 → 4) in https://tinyurl.com/hamkins-gblac. This proof takes advantage of the fact that the well-order constructed in (2 → 3) is also set-like. (Contributed by BTernaryTau, 8-Jun-2026.)
Hypothesis
Ref Expression
vonf1osev.1 𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝐹‘𝑥) ∈ (𝐹‘𝑦)}
Assertion
Ref Expression
vonf1osev (𝐹:V–1-1-onto→On → (𝑅 We V ∧ 𝑅 Se V))
Distinct variable group:   𝑥,𝐹,𝑦
Allowed substitution hints:   𝑅(𝑥, 𝑦)

Proof of Theorem vonf1osev
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vonf1osev.1 . . 3 𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝐹‘𝑥) ∈ (𝐹‘𝑦)}
21vonf1owev 35956 . 2 (𝐹:V–1-1-onto→On → 𝑅 We V)
3 vex 3454 . . . . . . 7 𝑤 ∈ V
4 vex 3454 . . . . . . 7 𝑧 ∈ V
5 fveq2 6885 . . . . . . . 8 (𝑥 = 𝑤 → (𝐹‘𝑥) = (𝐹‘𝑤))
65eleq1d 2845 . . . . . . 7 (𝑥 = 𝑤 → ((𝐹‘𝑥) ∈ (𝐹‘𝑦) ↔ (𝐹‘𝑤) ∈ (𝐹‘𝑦)))
7 fveq2 6885 . . . . . . . 8 (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
87eleq2d 2846 . . . . . . 7 (𝑦 = 𝑧 → ((𝐹‘𝑤) ∈ (𝐹‘𝑦) ↔ (𝐹‘𝑤) ∈ (𝐹‘𝑧)))
93, 4, 6, 8, 1brab 5517 . . . . . 6 (𝑤𝑅𝑧 ↔ (𝐹‘𝑤) ∈ (𝐹‘𝑧))
10 fvex 6898 . . . . . . 7 (𝐹‘𝑧) ∈ V
1110epeli 5552 . . . . . 6 ((𝐹‘𝑤) E (𝐹‘𝑧) ↔ (𝐹‘𝑤) ∈ (𝐹‘𝑧))
129, 11bitr4i 281 . . . . 5 (𝑤𝑅𝑧 ↔ (𝐹‘𝑤) E (𝐹‘𝑧))
1312rgen2w 3081 . . . 4 ∀𝑤 ∈ V ∀𝑧 ∈ V (𝑤𝑅𝑧 ↔ (𝐹‘𝑤) E (𝐹‘𝑧))
14 df-isom 6547 . . . 4 (𝐹 Isom 𝑅, E (V, On) ↔ (𝐹:V–1-1-onto→On ∧ ∀𝑤 ∈ V ∀𝑧 ∈ V (𝑤𝑅𝑧 ↔ (𝐹‘𝑤) E (𝐹‘𝑧))))
1513, 14mpbiran2 723 . . 3 (𝐹 Isom 𝑅, E (V, On) ↔ 𝐹:V–1-1-onto→On)
16 epse 5632 . . . 4 E Se On
17 isose 7351 . . . 4 (𝐹 Isom 𝑅, E (V, On) → (𝑅 Se V ↔ E Se On))
1816, 17mpbiri 261 . . 3 (𝐹 Isom 𝑅, E (V, On) → 𝑅 Se V)
1915, 18sylbir 238 . 2 (𝐹:V–1-1-onto→On → 𝑅 Se V)
202, 19jca 521 1 (𝐹:V–1-1-onto→On → (𝑅 We V ∧ 𝑅 Se V))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   class class class wbr 5102  {copab 5166   E cep 5549   Se wse 5601   We wwe 5602  Oncon0 6362  –1-1-onto→wf1o 6537  ‘cfv 6538   Isom wiso 6539
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator