MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordtype2 Structured version   Visualization version   GIF version

Theorem ordtype2 9548
Description: For any set-like well-ordered class, if the order isomorphism exists (is a set), then it maps some ordinal onto 𝐴 isomorphically. Otherwise, 𝐹 is a proper class, which implies that either ran 𝐹𝐴 is a proper class or dom 𝐹 = On. This weak version of ordtype 9546 does not require the Axiom of Replacement. (Contributed by Mario Carneiro, 25-Jun-2015.)
Hypothesis
Ref Expression
oicl.1 𝐹 = OrdIso(𝑅, 𝐴)
Assertion
Ref Expression
ordtype2 ((𝑅 We 𝐴𝑅 Se 𝐴𝐹 ∈ V) → 𝐹 Isom E , 𝑅 (dom 𝐹, 𝐴))

Proof of Theorem ordtype2
Dummy variables 𝑢 𝑡 𝑣 𝑥 𝑗 𝑤 𝑧 𝑓 𝑖 𝑟 𝑠 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2735 . . 3 recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) = recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
2 eqid 2735 . . 3 {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
3 eqid 2735 . . 3 ( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) = ( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
41, 2, 3ordtypecbv 9531 . 2 recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
5 eqid 2735 . 2 {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡}
6 oicl.1 . 2 𝐹 = OrdIso(𝑅, 𝐴)
7 simp1 1136 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴𝐹 ∈ V) → 𝑅 We 𝐴)
8 simp2 1137 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴𝐹 ∈ V) → 𝑅 Se 𝐴)
9 simp3 1138 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴𝐹 ∈ V) → 𝐹 ∈ V)
104, 2, 3, 5, 6, 7, 8, 9ordtypelem9 9540 1 ((𝑅 We 𝐴𝑅 Se 𝐴𝐹 ∈ V) → 𝐹 Isom E , 𝑅 (dom 𝐹, 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  w3a 1086   = wceq 1540  wcel 2108  wral 3051  wrex 3060  {crab 3415  Vcvv 3459   class class class wbr 5119  cmpt 5201   E cep 5552   Se wse 5604   We wwe 5605  dom cdm 5654  ran crn 5655  cima 5657  Oncon0 6352   Isom wiso 6532  crio 7361  recscrecs 8384  OrdIsocoi 9523
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-oi 9524
This theorem is referenced by:  oismo  9554
  Copyright terms: Public domain W3C validator