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

Theorem ordtypelem9 9513
Description: Lemma for ordtype 9519. Either the function OrdIso is an isomorphism onto all of 𝐴, or OrdIso is not a set, which by oif 9517 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 9512 . 2 (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂))
91, 2, 3, 4, 5, 6, 7ordtypelem4 9508 . . . . 5 (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
109frnd 6716 . . . 4 (𝜑 → ran 𝑂 ⊆ 𝐴)
111, 2, 3, 4, 5, 6, 7ordtypelem2 9506 . . . . . . . . . . 11 (𝜑 → Ord 𝑇)
12 ordirr 6379 . . . . . . . . . . 11 (Ord 𝑇 → ¬ 𝑇 ∈ 𝑇)
1311, 12syl 18 . . . . . . . . . 10 (𝜑 → ¬ 𝑇 ∈ 𝑇)
141tfr1a 8395 . . . . . . . . . . . . . 14 (Fun 𝐹 ∧ Lim dom 𝐹)
1514simpri 491 . . . . . . . . . . . . 13 Lim dom 𝐹
16 limord 6423 . . . . . . . . . . . . 13 (Lim dom 𝐹 → Ord dom 𝐹)
1715, 16ax-mp 5 . . . . . . . . . . . 12 Ord dom 𝐹
181, 2, 3, 4, 5, 6, 7ordtypelem1 9505 . . . . . . . . . . . . . 14 (𝜑 → 𝑂 = (𝐹 ↾ 𝑇))
19 ordtypelem9.1 . . . . . . . . . . . . . . 15 (𝜑 → 𝑂 ∈ 𝑉)
2019elexd 3474 . . . . . . . . . . . . . 14 (𝜑 → 𝑂 ∈ V)
2118, 20eqeltrrd 2862 . . . . . . . . . . . . 13 (𝜑 → (𝐹 ↾ 𝑇) ∈ V)
221tfr2b 8397 . . . . . . . . . . . . . 14 (Ord 𝑇 → (𝑇 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑇) ∈ V))
2311, 22syl 18 . . . . . . . . . . . . 13 (𝜑 → (𝑇 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑇) ∈ V))
2421, 23mpbird 260 . . . . . . . . . . . 12 (𝜑 → 𝑇 ∈ dom 𝐹)
25 ordelon 6385 . . . . . . . . . . . 12 ((Ord dom 𝐹 ∧ 𝑇 ∈ dom 𝐹) → 𝑇 ∈ On)
2617, 24, 25sylancr 599 . . . . . . . . . . 11 (𝜑 → 𝑇 ∈ On)
27 imaeq2 6048 . . . . . . . . . . . . . . 15 (𝑎 = 𝑇 → (𝐹 “ 𝑎) = (𝐹 “ 𝑇))
2827raleqdv 3320 . . . . . . . . . . . . . 14 (𝑎 = 𝑇 → (∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
2928rexbidv 3187 . . . . . . . . . . . . 13 (𝑎 = 𝑇 → (∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
30 breq1 5106 . . . . . . . . . . . . . . . . . . 19 (𝑧 = 𝑐 → (𝑧𝑅𝑡 ↔ 𝑐𝑅𝑡))
3130cbvralvw 3241 . . . . . . . . . . . . . . . . . 18 (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑡)
32 breq2 5107 . . . . . . . . . . . . . . . . . . 19 (𝑡 = 𝑏 → (𝑐𝑅𝑡 ↔ 𝑐𝑅𝑏))
3332ralbidv 3186 . . . . . . . . . . . . . . . . . 18 (𝑡 = 𝑏 → (∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏))
3431, 33bitrid 286 . . . . . . . . . . . . . . . . 17 (𝑡 = 𝑏 → (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏))
3534cbvrexvw 3242 . . . . . . . . . . . . . . . 16 (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏)
36 imaeq2 6048 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑎 → (𝐹 “ 𝑥) = (𝐹 “ 𝑎))
3736raleqdv 3320 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑎 → (∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
3837rexbidv 3187 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑎 → (∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
3935, 38bitrid 286 . . . . . . . . . . . . . . 15 (𝑥 = 𝑎 → (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
4039cbvrabv 3423 . . . . . . . . . . . . . 14 {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} = {𝑎 ∈ On ∣ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏}
414, 40eqtri 2784 . . . . . . . . . . . . 13 𝑇 = {𝑎 ∈ On ∣ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏}
4229, 41elrab2 3649 . . . . . . . . . . . 12 (𝑇 ∈ 𝑇 ↔ (𝑇 ∈ On ∧ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
4342baib 545 . . . . . . . . . . 11 (𝑇 ∈ On → (𝑇 ∈ 𝑇 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
4426, 43syl 18 . . . . . . . . . 10 (𝜑 → (𝑇 ∈ 𝑇 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
4513, 44mtbid 327 . . . . . . . . 9 (𝜑 → ¬ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
46 ralnex 3089 . . . . . . . . 9 (∀𝑏 ∈ 𝐴 ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏 ↔ ¬ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
4745, 46sylibr 237 . . . . . . . 8 (𝜑 → ∀𝑏 ∈ 𝐴 ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
4847r19.21bi 3255 . . . . . . 7 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
4918rneqd 5920 . . . . . . . . . . 11 (𝜑 → ran 𝑂 = ran (𝐹 ↾ 𝑇))
50 df-ima 5664 . . . . . . . . . . 11 (𝐹 “ 𝑇) = ran (𝐹 ↾ 𝑇)
5149, 50eqtr4di 2814 . . . . . . . . . 10 (𝜑 → ran 𝑂 = (𝐹 “ 𝑇))
5251adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ran 𝑂 = (𝐹 “ 𝑇))
5352raleqdv 3320 . . . . . . . 8 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
549ffund 6712 . . . . . . . . . . 11 (𝜑 → Fun 𝑂)
5554funfnd 6569 . . . . . . . . . 10 (𝜑 → 𝑂 Fn dom 𝑂)
5655adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑂 Fn dom 𝑂)
57 breq1 5106 . . . . . . . . . 10 (𝑐 = (𝑂‘𝑚) → (𝑐𝑅𝑏 ↔ (𝑂‘𝑚)𝑅𝑏))
5857ralrn 7086 . . . . . . . . 9 (𝑂 Fn dom 𝑂 → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
5956, 58syl 18 . . . . . . . 8 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
6053, 59bitr3d 284 . . . . . . 7 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
6148, 60mtbid 327 . . . . . 6 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
62 rexnal 3115 . . . . . 6 (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 ↔ ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
6361, 62sylibr 237 . . . . 5 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏)
641, 2, 3, 4, 5, 6, 7ordtypelem7 9511 . . . . . . 7 (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → ((𝑂‘𝑚)𝑅𝑏 ∨ 𝑏 ∈ ran 𝑂))
6564ord 878 . . . . . 6 (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → (¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
6665rexlimdva 3164 . . . . 5 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
6763, 66mpd 16 . . . 4 ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ ran 𝑂)
6810, 67eqelssd 3952 . . 3 (𝜑 → ran 𝑂 = 𝐴)
69 isoeq5 7327 . . 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 2145  ∀wral 3077  ∃wrex 3087  {crab 3413  Vcvv 3451   ∩ cin 3898   class class class wbr 5103   ↦ cmpt 5186   E cep 5550   Se wse 5602   We wwe 5603  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Ord word 6360  Oncon0 6361  Lim wlim 6362  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537   Isom wiso 6538  ℩crio 7374  recscrecs 8371  OrdIsocoi 9496
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7375  df-ov 7421  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-oi 9497
This theorem is used by:  ordtypelem10  9514  ordtype2  9521
  Copyright terms: Public domain W3C validator