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

Theorem oif 9502
Description: The order isomorphism of the well-order 𝑅 on 𝐴 is a function. (Contributed by Mario Carneiro, 23-May-2015.)
Hypothesis
Ref Expression
oicl.1 𝐹 = OrdIso(𝑅, 𝐴)
Assertion
Ref Expression
oif 𝐹:dom 𝐹𝐴

Proof of Theorem oif
Dummy variables 𝑢 𝑡 𝑣 𝑥 𝑗 𝑤 𝑧 𝑓 𝑖 𝑟 𝑠 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . . 5 recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))) = recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
2 eqid 2760 . . . . 5 {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
3 eqid 2760 . . . . 5 ( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)) = ( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣))
41, 2, 3ordtypecbv 9489 . . . 4 recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = recs(( ∈ V ↦ (𝑣 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}∀𝑢 ∈ {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤} ¬ 𝑢𝑅𝑣)))
5 eqid 2760 . . . 4 {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡} = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (recs((𝑓 ∈ V ↦ (𝑠 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) “ 𝑥)𝑧𝑅𝑡}
6 oicl.1 . . . 4 𝐹 = OrdIso(𝑅, 𝐴)
7 simpl 488 . . . 4 ((𝑅 We 𝐴𝑅 Se 𝐴) → 𝑅 We 𝐴)
8 simpr 490 . . . 4 ((𝑅 We 𝐴𝑅 Se 𝐴) → 𝑅 Se 𝐴)
94, 2, 3, 5, 6, 7, 8ordtypelem5 9494 . . 3 ((𝑅 We 𝐴𝑅 Se 𝐴) → (Ord dom 𝐹𝐹:dom 𝐹𝐴))
109simprd 501 . 2 ((𝑅 We 𝐴𝑅 Se 𝐴) → 𝐹:dom 𝐹𝐴)
11 f0 6756 . . 3 ∅:∅⟶𝐴
126oi0 9500 . . . 4 (¬ (𝑅 We 𝐴𝑅 Se 𝐴) → 𝐹 = ∅)
1312dmeqd 5889 . . . . 5 (¬ (𝑅 We 𝐴𝑅 Se 𝐴) → dom 𝐹 = dom ∅)
14 dm0 5904 . . . . 5 dom ∅ = ∅
1513, 14eqtrdi 2811 . . . 4 (¬ (𝑅 We 𝐴𝑅 Se 𝐴) → dom 𝐹 = ∅)
1612, 15feq12d 6690 . . 3 (¬ (𝑅 We 𝐴𝑅 Se 𝐴) → (𝐹:dom 𝐹𝐴 ↔ ∅:∅⟶𝐴))
1711, 16mpbiri 261 . 2 (¬ (𝑅 We 𝐴𝑅 Se 𝐴) → 𝐹:dom 𝐹𝐴)
1810, 17pm2.61i 184 1 𝐹:dom 𝐹𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wa 401   = wceq 1570  wral 3076  wrex 3086  {crab 3412  Vcvv 3450  c0 4279   class class class wbr 5103  cmpt 5186   Se wse 5606   We wwe 5607  dom cdm 5655  ran crn 5656  cima 5658  Ord word 6356  Oncon0 6357  wf 6529  crio 7369  recscrecs 8359  OrdIsocoi 9481
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736
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 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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-oi 9482
This theorem is used by:  oismo  9512  cantnfle  9650  cantnflt  9651  cantnfres  9656  cantnfp1lem3  9659  cantnflem1b  9665  cantnflem1  9668  wemapwe  9676  cnfcomlem  9678  cnfcom  9679  cnfcom3lem  9682  cnfcom3  9683  hsmexlem1  10428  hsmexlem2  10429  fpwwe2lem7  10646
  Copyright terms: Public domain W3C validator