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

Theorem ordtypelem9 9491
Description: Lemma for ordtype 9497. Either the function OrdIso is an isomorphism onto all of 𝐴, or OrdIso is not a set, which by oif 9495 implies that either ran 𝑂𝐴 is a proper class or dom 𝑂 = On. (Contributed by Mario Carneiro, 25-Jun-2015.) (Revised by AV, 28-Jul-2024.)
Hypotheses
Ref Expression
ordtypelem.1 𝐹 = recs(𝐺)
ordtypelem.2 𝐶 = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
ordtypelem.3 𝐺 = ( ∈ V ↦ (𝑣𝐶𝑢𝐶 ¬ 𝑢𝑅𝑣))
ordtypelem.5 𝑇 = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}
ordtypelem.6 𝑂 = OrdIso(𝑅, 𝐴)
ordtypelem.7 (𝜑𝑅 We 𝐴)
ordtypelem.8 (𝜑𝑅 Se 𝐴)
ordtypelem9.1 (𝜑𝑂𝑉)
Assertion
Ref Expression
ordtypelem9 (𝜑𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴))
Distinct variable groups:   𝑣,𝑢,𝐶   ,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧,𝑅   𝐴,,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧   𝑡,𝑂,𝑢,𝑣,𝑥   𝜑,𝑡,𝑥   ,𝐹,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧
Allowed substitution hints:   𝜑(𝑧, 𝑤, 𝑣, 𝑢, , 𝑗)   𝐶(𝑥, 𝑧, 𝑤, 𝑡, , 𝑗)   𝑇(𝑥, 𝑧, 𝑤, 𝑣, 𝑢, 𝑡, , 𝑗)   𝐺(𝑥, 𝑧, 𝑤, 𝑣, 𝑢, 𝑡, , 𝑗)   𝑂(𝑧, 𝑤, , 𝑗)   𝑉(𝑥, 𝑧, 𝑤, 𝑣, 𝑢, 𝑡, , 𝑗)

Proof of Theorem ordtypelem9
Dummy variables 𝑎 𝑏 𝑐 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ordtypelem.1 . . 3 𝐹 = recs(𝐺)
2 ordtypelem.2 . . 3 𝐶 = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
3 ordtypelem.3 . . 3 𝐺 = ( ∈ V ↦ (𝑣𝐶𝑢𝐶 ¬ 𝑢𝑅𝑣))
4 ordtypelem.5 . . 3 𝑇 = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}
5 ordtypelem.6 . . 3 𝑂 = OrdIso(𝑅, 𝐴)
6 ordtypelem.7 . . 3 (𝜑𝑅 We 𝐴)
7 ordtypelem.8 . . 3 (𝜑𝑅 Se 𝐴)
81, 2, 3, 4, 5, 6, 7ordtypelem8 9490 . 2 (𝜑𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂))
91, 2, 3, 4, 5, 6, 7ordtypelem4 9486 . . . . 5 (𝜑𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
109frnd 6718 . . . 4 (𝜑 → ran 𝑂𝐴)
111, 2, 3, 4, 5, 6, 7ordtypelem2 9484 . . . . . . . . . . 11 (𝜑 → Ord 𝑇)
12 ordirr 6382 . . . . . . . . . . 11 (Ord 𝑇 → ¬ 𝑇𝑇)
1311, 12syl 18 . . . . . . . . . 10 (𝜑 → ¬ 𝑇𝑇)
141tfr1a 8383 . . . . . . . . . . . . . 14 (Fun 𝐹 ∧ Lim dom 𝐹)
1514simpri 491 . . . . . . . . . . . . 13 Lim dom 𝐹
16 limord 6426 . . . . . . . . . . . . 13 (Lim dom 𝐹 → Ord dom 𝐹)
1715, 16ax-mp 5 . . . . . . . . . . . 12 Ord dom 𝐹
181, 2, 3, 4, 5, 6, 7ordtypelem1 9483 . . . . . . . . . . . . . 14 (𝜑𝑂 = (𝐹𝑇))
19 ordtypelem9.1 . . . . . . . . . . . . . . 15 (𝜑𝑂𝑉)
2019elexd 3480 . . . . . . . . . . . . . 14 (𝜑𝑂 ∈ V)
2118, 20eqeltrrd 2866 . . . . . . . . . . . . 13 (𝜑 → (𝐹𝑇) ∈ V)
221tfr2b 8385 . . . . . . . . . . . . . 14 (Ord 𝑇 → (𝑇 ∈ dom 𝐹 ↔ (𝐹𝑇) ∈ V))
2311, 22syl 18 . . . . . . . . . . . . 13 (𝜑 → (𝑇 ∈ dom 𝐹 ↔ (𝐹𝑇) ∈ V))
2421, 23mpbird 260 . . . . . . . . . . . 12 (𝜑𝑇 ∈ dom 𝐹)
25 ordelon 6388 . . . . . . . . . . . 12 ((Ord dom 𝐹𝑇 ∈ dom 𝐹) → 𝑇 ∈ On)
2617, 24, 25sylancr 599 . . . . . . . . . . 11 (𝜑𝑇 ∈ On)
27 imaeq2 6060 . . . . . . . . . . . . . . 15 (𝑎 = 𝑇 → (𝐹𝑎) = (𝐹𝑇))
2827raleqdv 3325 . . . . . . . . . . . . . 14 (𝑎 = 𝑇 → (∀𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏))
2928rexbidv 3191 . . . . . . . . . . . . 13 (𝑎 = 𝑇 → (∃𝑏𝐴𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏 ↔ ∃𝑏𝐴𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏))
30 breq1 5114 . . . . . . . . . . . . . . . . . . 19 (𝑧 = 𝑐 → (𝑧𝑅𝑡𝑐𝑅𝑡))
3130cbvralvw 3245 . . . . . . . . . . . . . . . . . 18 (∀𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑡)
32 breq2 5115 . . . . . . . . . . . . . . . . . . 19 (𝑡 = 𝑏 → (𝑐𝑅𝑡𝑐𝑅𝑏))
3332ralbidv 3190 . . . . . . . . . . . . . . . . . 18 (𝑡 = 𝑏 → (∀𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑏))
3431, 33bitrid 286 . . . . . . . . . . . . . . . . 17 (𝑡 = 𝑏 → (∀𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑏))
3534cbvrexvw 3246 . . . . . . . . . . . . . . . 16 (∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡 ↔ ∃𝑏𝐴𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑏)
36 imaeq2 6060 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑎 → (𝐹𝑥) = (𝐹𝑎))
3736raleqdv 3325 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑎 → (∀𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏))
3837rexbidv 3191 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑎 → (∃𝑏𝐴𝑐 ∈ (𝐹𝑥)𝑐𝑅𝑏 ↔ ∃𝑏𝐴𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏))
3935, 38bitrid 286 . . . . . . . . . . . . . . 15 (𝑥 = 𝑎 → (∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡 ↔ ∃𝑏𝐴𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏))
4039cbvrabv 3428 . . . . . . . . . . . . . 14 {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡} = {𝑎 ∈ On ∣ ∃𝑏𝐴𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏}
414, 40eqtri 2788 . . . . . . . . . . . . 13 𝑇 = {𝑎 ∈ On ∣ ∃𝑏𝐴𝑐 ∈ (𝐹𝑎)𝑐𝑅𝑏}
4229, 41elrab2 3656 . . . . . . . . . . . 12 (𝑇𝑇 ↔ (𝑇 ∈ On ∧ ∃𝑏𝐴𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏))
4342baib 545 . . . . . . . . . . 11 (𝑇 ∈ On → (𝑇𝑇 ↔ ∃𝑏𝐴𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏))
4426, 43syl 18 . . . . . . . . . 10 (𝜑 → (𝑇𝑇 ↔ ∃𝑏𝐴𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏))
4513, 44mtbid 327 . . . . . . . . 9 (𝜑 → ¬ ∃𝑏𝐴𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏)
46 ralnex 3093 . . . . . . . . 9 (∀𝑏𝐴 ¬ ∀𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏 ↔ ¬ ∃𝑏𝐴𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏)
4745, 46sylibr 237 . . . . . . . 8 (𝜑 → ∀𝑏𝐴 ¬ ∀𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏)
4847r19.21bi 3259 . . . . . . 7 ((𝜑𝑏𝐴) → ¬ ∀𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏)
4918rneqd 5930 . . . . . . . . . . 11 (𝜑 → ran 𝑂 = ran (𝐹𝑇))
50 df-ima 5676 . . . . . . . . . . 11 (𝐹𝑇) = ran (𝐹𝑇)
5149, 50eqtr4di 2818 . . . . . . . . . 10 (𝜑 → ran 𝑂 = (𝐹𝑇))
5251adantr 486 . . . . . . . . 9 ((𝜑𝑏𝐴) → ran 𝑂 = (𝐹𝑇))
5352raleqdv 3325 . . . . . . . 8 ((𝜑𝑏𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏))
549ffund 6714 . . . . . . . . . . 11 (𝜑 → Fun 𝑂)
5554funfnd 6571 . . . . . . . . . 10 (𝜑𝑂 Fn dom 𝑂)
5655adantr 486 . . . . . . . . 9 ((𝜑𝑏𝐴) → 𝑂 Fn dom 𝑂)
57 breq1 5114 . . . . . . . . . 10 (𝑐 = (𝑂𝑚) → (𝑐𝑅𝑏 ↔ (𝑂𝑚)𝑅𝑏))
5857ralrn 7087 . . . . . . . . 9 (𝑂 Fn dom 𝑂 → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂𝑚)𝑅𝑏))
5956, 58syl 18 . . . . . . . 8 ((𝜑𝑏𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂𝑚)𝑅𝑏))
6053, 59bitr3d 284 . . . . . . 7 ((𝜑𝑏𝐴) → (∀𝑐 ∈ (𝐹𝑇)𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂𝑚)𝑅𝑏))
6148, 60mtbid 327 . . . . . 6 ((𝜑𝑏𝐴) → ¬ ∀𝑚 ∈ dom 𝑂(𝑂𝑚)𝑅𝑏)
62 rexnal 3119 . . . . . 6 (∃𝑚 ∈ dom 𝑂 ¬ (𝑂𝑚)𝑅𝑏 ↔ ¬ ∀𝑚 ∈ dom 𝑂(𝑂𝑚)𝑅𝑏)
6361, 62sylibr 237 . . . . 5 ((𝜑𝑏𝐴) → ∃𝑚 ∈ dom 𝑂 ¬ (𝑂𝑚)𝑅𝑏)
641, 2, 3, 4, 5, 6, 7ordtypelem7 9489 . . . . . . 7 (((𝜑𝑏𝐴) ∧ 𝑚 ∈ dom 𝑂) → ((𝑂𝑚)𝑅𝑏𝑏 ∈ ran 𝑂))
6564ord 878 . . . . . 6 (((𝜑𝑏𝐴) ∧ 𝑚 ∈ dom 𝑂) → (¬ (𝑂𝑚)𝑅𝑏𝑏 ∈ ran 𝑂))
6665rexlimdva 3168 . . . . 5 ((𝜑𝑏𝐴) → (∃𝑚 ∈ dom 𝑂 ¬ (𝑂𝑚)𝑅𝑏𝑏 ∈ ran 𝑂))
6763, 66mpd 16 . . . 4 ((𝜑𝑏𝐴) → 𝑏 ∈ ran 𝑂)
6810, 67eqelssd 3959 . . 3 (𝜑 → ran 𝑂 = 𝐴)
69 isoeq5 7325 . . 3 (ran 𝑂 = 𝐴 → (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) ↔ 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴)))
7068, 69syl 18 . 2 (𝜑 → (𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂) ↔ 𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴)))
718, 70mpbid 235 1 (𝜑𝑂 Isom E , 𝑅 (dom 𝑂, 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wral 3081  wrex 3091  {crab 3418  Vcvv 3457  cin 3905   class class class wbr 5111  cmpt 5194   E cep 5562   Se wse 5614   We wwe 5615  dom cdm 5663  ran crn 5664  cres 5665  cima 5666  Ord word 6363  Oncon0 6364  Lim wlim 6365  Fun wfun 6534   Fn wfn 6535  cfv 6540   Isom wiso 6541  crio 7372  recscrecs 8359  OrdIsocoi 9474
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 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7373  df-ov 7419  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-oi 9475
This theorem is used by:  ordtypelem10  9492  ordtype2  9499
  Copyright terms: Public domain W3C validator