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

Theorem ordtype2 9494
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 9492 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 2730 . . 3 recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) = recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
2 eqid 2730 . . 3 {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
3 eqid 2730 . . 3 ( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) = ( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
41, 2, 3ordtypecbv 9477 . 2 recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
5 eqid 2730 . 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 9486 1 ((𝑅 We 𝐴𝑅 Se 𝐴𝐹 ∈ V) → 𝐹 Isom E , 𝑅 (dom 𝐹, 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  w3a 1086   = wceq 1540  wcel 2109  wral 3045  wrex 3054  {crab 3408  Vcvv 3450   class class class wbr 5110  cmpt 5191   E cep 5540   Se wse 5592   We wwe 5593  dom cdm 5641  ran crn 5642  cima 5644  Oncon0 6335   Isom wiso 6515  crio 7346  recscrecs 8342  OrdIsocoi 9469
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
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 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-se 5595  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-isom 6523  df-riota 7347  df-ov 7393  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-oi 9470
This theorem is referenced by:  oismo  9500
  Copyright terms: Public domain W3C validator