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

Theorem ordtypelem9 9557
Description: Lemma for ordtype 9563. Either the function OrdIso is an isomorphism onto all of 𝐴, or OrdIso is not a set, which by oif 9561 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 9556 . 2 (𝜑 → 𝑂 Isom E , 𝑅 (dom 𝑂, ran 𝑂))
91, 2, 3, 4, 5, 6, 7ordtypelem4 9552 . . . . 5 (𝜑 → 𝑂:(𝑇 ∩ dom 𝐹)⟶𝐴)
109frnd 6748 . . . 4 (𝜑 → ran 𝑂 ⊆ 𝐴)
111, 2, 3, 4, 5, 6, 7ordtypelem2 9550 . . . . . . . . . . 11 (𝜑 → Ord 𝑇)
12 ordirr 6406 . . . . . . . . . . 11 (Ord 𝑇 → ¬ 𝑇 ∈ 𝑇)
1311, 12syl 18 . . . . . . . . . 10 (𝜑 → ¬ 𝑇 ∈ 𝑇)
141tfr1a 8440 . . . . . . . . . . . . . 14 (Fun 𝐹 ∧ Lim dom 𝐹)
1514simpri 491 . . . . . . . . . . . . 13 Lim dom 𝐹
16 limord 6450 . . . . . . . . . . . . 13 (Lim dom 𝐹 → Ord dom 𝐹)
1715, 16ax-mp 5 . . . . . . . . . . . 12 Ord dom 𝐹
181, 2, 3, 4, 5, 6, 7ordtypelem1 9549 . . . . . . . . . . . . . 14 (𝜑 → 𝑂 = (𝐹 ↾ 𝑇))
19 ordtypelem9.1 . . . . . . . . . . . . . . 15 (𝜑 → 𝑂 ∈ 𝑉)
2019elexd 3477 . . . . . . . . . . . . . 14 (𝜑 → 𝑂 ∈ V)
2118, 20eqeltrrd 2865 . . . . . . . . . . . . 13 (𝜑 → (𝐹 ↾ 𝑇) ∈ V)
221tfr2b 8442 . . . . . . . . . . . . . 14 (Ord 𝑇 → (𝑇 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑇) ∈ V))
2311, 22syl 18 . . . . . . . . . . . . 13 (𝜑 → (𝑇 ∈ dom 𝐹 ↔ (𝐹 ↾ 𝑇) ∈ V))
2421, 23mpbird 260 . . . . . . . . . . . 12 (𝜑 → 𝑇 ∈ dom 𝐹)
25 ordelon 6412 . . . . . . . . . . . 12 ((Ord dom 𝐹 ∧ 𝑇 ∈ dom 𝐹) → 𝑇 ∈ On)
2617, 24, 25sylancr 599 . . . . . . . . . . 11 (𝜑 → 𝑇 ∈ On)
27 imaeq2 6066 . . . . . . . . . . . . . . 15 (𝑎 = 𝑇 → (𝐹 “ 𝑎) = (𝐹 “ 𝑇))
2827raleqdv 3323 . . . . . . . . . . . . . 14 (𝑎 = 𝑇 → (∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
2928rexbidv 3190 . . . . . . . . . . . . 13 (𝑎 = 𝑇 → (∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
30 breq1 5111 . . . . . . . . . . . . . . . . . . 19 (𝑧 = 𝑐 → (𝑧𝑅𝑡 ↔ 𝑐𝑅𝑡))
3130cbvralvw 3244 . . . . . . . . . . . . . . . . . 18 (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑡)
32 breq2 5112 . . . . . . . . . . . . . . . . . . 19 (𝑡 = 𝑏 → (𝑐𝑅𝑡 ↔ 𝑐𝑅𝑏))
3332ralbidv 3189 . . . . . . . . . . . . . . . . . 18 (𝑡 = 𝑏 → (∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏))
3431, 33bitrid 286 . . . . . . . . . . . . . . . . 17 (𝑡 = 𝑏 → (∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏))
3534cbvrexvw 3245 . . . . . . . . . . . . . . . 16 (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏)
36 imaeq2 6066 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑎 → (𝐹 “ 𝑥) = (𝐹 “ 𝑎))
3736raleqdv 3323 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑎 → (∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
3837rexbidv 3190 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑎 → (∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑥)𝑐𝑅𝑏 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
3935, 38bitrid 286 . . . . . . . . . . . . . . 15 (𝑥 = 𝑎 → (∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏))
4039cbvrabv 3426 . . . . . . . . . . . . . 14 {𝑥 ∈ On ∣ ∃𝑡 ∈ 𝐴 ∀𝑧 ∈ (𝐹 “ 𝑥)𝑧𝑅𝑡} = {𝑎 ∈ On ∣ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏}
414, 40eqtri 2786 . . . . . . . . . . . . 13 𝑇 = {𝑎 ∈ On ∣ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑎)𝑐𝑅𝑏}
4229, 41elrab2 3652 . . . . . . . . . . . 12 (𝑇 ∈ 𝑇 ↔ (𝑇 ∈ On ∧ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
4342baib 545 . . . . . . . . . . 11 (𝑇 ∈ On → (𝑇 ∈ 𝑇 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
4426, 43syl 18 . . . . . . . . . 10 (𝜑 → (𝑇 ∈ 𝑇 ↔ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
4513, 44mtbid 327 . . . . . . . . 9 (𝜑 → ¬ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
46 ralnex 3092 . . . . . . . . 9 (∀𝑏 ∈ 𝐴 ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏 ↔ ¬ ∃𝑏 ∈ 𝐴 ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
4745, 46sylibr 237 . . . . . . . 8 (𝜑 → ∀𝑏 ∈ 𝐴 ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
4847r19.21bi 3258 . . . . . . 7 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ¬ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏)
4918rneqd 5932 . . . . . . . . . . 11 (𝜑 → ran 𝑂 = ran (𝐹 ↾ 𝑇))
50 df-ima 5671 . . . . . . . . . . 11 (𝐹 “ 𝑇) = ran (𝐹 ↾ 𝑇)
5149, 50eqtr4di 2816 . . . . . . . . . 10 (𝜑 → ran 𝑂 = (𝐹 “ 𝑇))
5251adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ran 𝑂 = (𝐹 “ 𝑇))
5352raleqdv 3323 . . . . . . . 8 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏))
549ffund 6744 . . . . . . . . . . 11 (𝜑 → Fun 𝑂)
5554funfnd 6599 . . . . . . . . . 10 (𝜑 → 𝑂 Fn dom 𝑂)
5655adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑂 Fn dom 𝑂)
57 breq1 5111 . . . . . . . . . 10 (𝑐 = (𝑂‘𝑚) → (𝑐𝑅𝑏 ↔ (𝑂‘𝑚)𝑅𝑏))
5857ralrn 7120 . . . . . . . . 9 (𝑂 Fn dom 𝑂 → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
5956, 58syl 18 . . . . . . . 8 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ ran 𝑂 𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
6053, 59bitr3d 284 . . . . . . 7 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∀𝑐 ∈ (𝐹 “ 𝑇)𝑐𝑅𝑏 ↔ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏))
6148, 60mtbid 327 . . . . . 6 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
62 rexnal 3118 . . . . . 6 (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 ↔ ¬ ∀𝑚 ∈ dom 𝑂(𝑂‘𝑚)𝑅𝑏)
6361, 62sylibr 237 . . . . 5 ((𝜑 ∧ 𝑏 ∈ 𝐴) → ∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏)
641, 2, 3, 4, 5, 6, 7ordtypelem7 9555 . . . . . . 7 (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → ((𝑂‘𝑚)𝑅𝑏 ∨ 𝑏 ∈ ran 𝑂))
6564ord 878 . . . . . 6 (((𝜑 ∧ 𝑏 ∈ 𝐴) ∧ 𝑚 ∈ dom 𝑂) → (¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
6665rexlimdva 3167 . . . . 5 ((𝜑 ∧ 𝑏 ∈ 𝐴) → (∃𝑚 ∈ dom 𝑂 ¬ (𝑂‘𝑚)𝑅𝑏 → 𝑏 ∈ ran 𝑂))
6763, 66mpd 16 . . . 4 ((𝜑 ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ ran 𝑂)
6810, 67eqelssd 3934 . . 3 (𝜑 → ran 𝑂 = 𝐴)
69 isoeq5 7360 . . 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 2147  ∀wral 3080  ∃wrex 3090  {crab 3416  Vcvv 3454   ∩ cin 4092   class class class wbr 5108   ↦ cmpt 5192   E cep 5557   Se wse 5609   We wwe 5610  dom cdm 5658  ran crn 5659   ↾ cres 5660   “ cima 5661  Ord word 6387  Oncon0 6388  Lim wlim 6389  Fun wfun 6560   Fn wfn 6561  ‘cfv 6566   Isom wiso 6567  ℩crio 7407  recscrecs 8416  OrdIsocoi 9540
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-oi 9541
This theorem is used by:  ordtypelem10  9558  ordtype2  9565
  Copyright terms: Public domain W3C validator