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 35620
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 is 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 35617 . 2 (𝐹:V–1-1-onto→On → 𝑅 We V)
3 vex 3462 . . . . . . 7 𝑤 ∈ V
4 vex 3462 . . . . . . 7 𝑧 ∈ V
5 fveq2 6888 . . . . . . . 8 (𝑥 = 𝑤 → (𝐹𝑥) = (𝐹𝑤))
65eleq1d 2851 . . . . . . 7 (𝑥 = 𝑤 → ((𝐹𝑥) ∈ (𝐹𝑦) ↔ (𝐹𝑤) ∈ (𝐹𝑦)))
7 fveq2 6888 . . . . . . . 8 (𝑦 = 𝑧 → (𝐹𝑦) = (𝐹𝑧))
87eleq2d 2852 . . . . . . 7 (𝑦 = 𝑧 → ((𝐹𝑤) ∈ (𝐹𝑦) ↔ (𝐹𝑤) ∈ (𝐹𝑧)))
93, 4, 6, 8, 1brab 5533 . . . . . 6 (𝑤𝑅𝑧 ↔ (𝐹𝑤) ∈ (𝐹𝑧))
10 fvex 6901 . . . . . . 7 (𝐹𝑧) ∈ V
1110epeli 5568 . . . . . 6 ((𝐹𝑤) E (𝐹𝑧) ↔ (𝐹𝑤) ∈ (𝐹𝑧))
129, 11bitr4i 281 . . . . 5 (𝑤𝑅𝑧 ↔ (𝐹𝑤) E (𝐹𝑧))
1312rgen2w 3087 . . . 4 𝑤 ∈ V ∀𝑧 ∈ V (𝑤𝑅𝑧 ↔ (𝐹𝑤) E (𝐹𝑧))
14 df-isom 6552 . . . 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 5648 . . . 4 E Se On
17 isose 7352 . . . 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 1570  wcel 2146  wral 3082  Vcvv 3458   class class class wbr 5114  {copab 5178   E cep 5565   Se wse 5617   We wwe 5618  Oncon0 6367  1-1-ontowf1o 6542  cfv 6543   Isom wiso 6544
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-int 4918  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-ord 6370  df-on 6371  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator