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

Theorem ordtypelem1 9490
Description: Lemma for ordtype 9504. (Contributed by Mario Carneiro, 24-Jun-2015.)
Hypotheses
Ref Expression
ordtypelem.1 𝐹 = recs(𝐺)
ordtypelem.2 𝐶 = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
ordtypelem.3 𝐺 = ( ∈ V ↦ (𝑣𝐶𝑢𝐶 ¬ 𝑢𝑅𝑣))
ordtypelem.5 𝑇 = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}
ordtypelem.6 𝑂 = OrdIso(𝑅, 𝐴)
ordtypelem.7 (𝜑𝑅 We 𝐴)
ordtypelem.8 (𝜑𝑅 Se 𝐴)
Assertion
Ref Expression
ordtypelem1 (𝜑𝑂 = (𝐹𝑇))
Distinct variable groups:   𝑣,𝑢,𝐶   ,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧,𝑅   𝐴,,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧   𝑡,𝑂,𝑢,𝑣,𝑥   𝜑,𝑡,𝑥   ,𝐹,𝑗,𝑡,𝑢,𝑣,𝑤,𝑥,𝑧
Allowed substitution hints:   𝜑(𝑧, 𝑤, 𝑣, 𝑢, , 𝑗)   𝐶(𝑥, 𝑧, 𝑤, 𝑡, , 𝑗)   𝑇(𝑥, 𝑧, 𝑤, 𝑣, 𝑢, 𝑡, , 𝑗)   𝐺(𝑥, 𝑧, 𝑤, 𝑣, 𝑢, 𝑡, , 𝑗)   𝑂(𝑧, 𝑤, , 𝑗)

Proof of Theorem ordtypelem1
StepHypRef Expression
1 ordtypelem.7 . . 3 (𝜑𝑅 We 𝐴)
2 ordtypelem.8 . . 3 (𝜑𝑅 Se 𝐴)
3 iftrue 4488 . . 3 ((𝑅 We 𝐴𝑅 Se 𝐴) → if((𝑅 We 𝐴𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}))
41, 2, 3syl2anc 596 . 2 (𝜑 → if((𝑅 We 𝐴𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}), ∅) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}))
5 ordtypelem.6 . . 3 𝑂 = OrdIso(𝑅, 𝐴)
6 ordtypelem.2 . . . 4 𝐶 = {𝑤𝐴 ∣ ∀𝑗 ∈ ran 𝑗𝑅𝑤}
7 ordtypelem.3 . . . 4 𝐺 = ( ∈ V ↦ (𝑣𝐶𝑢𝐶 ¬ 𝑢𝑅𝑣))
8 ordtypelem.1 . . . 4 𝐹 = recs(𝐺)
96, 7, 8dfoi 9483 . . 3 OrdIso(𝑅, 𝐴) = if((𝑅 We 𝐴𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}), ∅)
105, 9eqtri 2783 . 2 𝑂 = if((𝑅 We 𝐴𝑅 Se 𝐴), (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}), ∅)
11 ordtypelem.5 . . 3 𝑇 = {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡}
1211reseq2i 5969 . 2 (𝐹𝑇) = (𝐹 ↾ {𝑥 ∈ On ∣ ∃𝑡𝐴𝑧 ∈ (𝐹𝑥)𝑧𝑅𝑡})
134, 10, 123eqtr4g 2820 1 (𝜑𝑂 = (𝐹𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wral 3076  wrex 3086  {crab 3412  Vcvv 3450  c0 4279  ifcif 4482   class class class wbr 5103  cmpt 5186   Se wse 5606   We wwe 5607  ran crn 5656  cres 5657  cima 5658  Oncon0 6357  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-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-xp 5661  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-iota 6489  df-fv 6541  df-riota 7370  df-ov 7416  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-oi 9482
This theorem is used by:  ordtypelem4  9493  ordtypelem6  9495  ordtypelem7  9496  ordtypelem9  9498
  Copyright terms: Public domain W3C validator