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

Theorem ordtypecbv 9515
Description: Lemma for ordtype 9530. (Contributed by Mario Carneiro, 26-Jun-2015.)
Hypotheses
Ref Expression
ordtypelem.1 𝐹 = recs(𝐺)
ordtypelem.2 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
ordtypelem.3 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
Assertion
Ref Expression
ordtypecbv recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = 𝐹
Distinct variable groups:   𝑓,𝑟,𝑠,𝑢,𝑣,𝐶   ℎ,𝑗,𝑢,𝑣,𝑤,𝑓,𝑖,𝑦,𝑅,𝑟,𝑠   𝐴,ℎ,𝑗,𝑟,𝑠,𝑢,𝑣,𝑤,𝑦
Allowed substitution hints:   𝐴(𝑓, 𝑖)   𝐶(𝑦, 𝑤, ℎ, 𝑖, 𝑗)   𝐹(𝑦, 𝑤, 𝑣, 𝑢, 𝑓, ℎ, 𝑖, 𝑗, 𝑠, 𝑟)   𝐺(𝑦, 𝑤, 𝑣, 𝑢, 𝑓, ℎ, 𝑖, 𝑗, 𝑠, 𝑟)

Proof of Theorem ordtypecbv
StepHypRef Expression
1 ordtypelem.1 . 2 𝐹 = recs(𝐺)
2 ordtypelem.3 . . . 4 𝐺 = (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣))
3 breq1 5105 . . . . . . . . . 10 (𝑢 = 𝑟 → (𝑢𝑅𝑣 ↔ 𝑟𝑅𝑣))
43notbid 321 . . . . . . . . 9 (𝑢 = 𝑟 → (¬ 𝑢𝑅𝑣 ↔ ¬ 𝑟𝑅𝑣))
54cbvralvw 3240 . . . . . . . 8 (∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣 ↔ ∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑣)
6 breq2 5106 . . . . . . . . . 10 (𝑣 = 𝑠 → (𝑟𝑅𝑣 ↔ 𝑟𝑅𝑠))
76notbid 321 . . . . . . . . 9 (𝑣 = 𝑠 → (¬ 𝑟𝑅𝑣 ↔ ¬ 𝑟𝑅𝑠))
87ralbidv 3185 . . . . . . . 8 (𝑣 = 𝑠 → (∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑣 ↔ ∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑠))
95, 8bitrid 286 . . . . . . 7 (𝑣 = 𝑠 → (∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣 ↔ ∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑠))
109cbvriotavw 7388 . . . . . 6 (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣) = (℩𝑠 ∈ 𝐶 ∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑠)
11 ordtypelem.2 . . . . . . . . 9 𝐶 = {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤}
12 breq1 5105 . . . . . . . . . . . 12 (𝑗 = 𝑖 → (𝑗𝑅𝑤 ↔ 𝑖𝑅𝑤))
1312cbvralvw 3240 . . . . . . . . . . 11 (∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤 ↔ ∀𝑖 ∈ ran ℎ 𝑖𝑅𝑤)
14 breq2 5106 . . . . . . . . . . . 12 (𝑤 = 𝑦 → (𝑖𝑅𝑤 ↔ 𝑖𝑅𝑦))
1514ralbidv 3185 . . . . . . . . . . 11 (𝑤 = 𝑦 → (∀𝑖 ∈ ran ℎ 𝑖𝑅𝑤 ↔ ∀𝑖 ∈ ran ℎ 𝑖𝑅𝑦))
1613, 15bitrid 286 . . . . . . . . . 10 (𝑤 = 𝑦 → (∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤 ↔ ∀𝑖 ∈ ran ℎ 𝑖𝑅𝑦))
1716cbvrabv 3422 . . . . . . . . 9 {𝑤 ∈ 𝐴 ∣ ∀𝑗 ∈ ran ℎ 𝑗𝑅𝑤} = {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran ℎ 𝑖𝑅𝑦}
1811, 17eqtri 2783 . . . . . . . 8 𝐶 = {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran ℎ 𝑖𝑅𝑦}
19 rneq 5917 . . . . . . . . . 10 (ℎ = 𝑓 → ran ℎ = ran 𝑓)
2019raleqdv 3319 . . . . . . . . 9 (ℎ = 𝑓 → (∀𝑖 ∈ ran ℎ 𝑖𝑅𝑦 ↔ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦))
2120rabbidv 3419 . . . . . . . 8 (ℎ = 𝑓 → {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran ℎ 𝑖𝑅𝑦} = {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦})
2218, 21eqtrid 2807 . . . . . . 7 (ℎ = 𝑓 → 𝐶 = {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦})
2322raleqdv 3319 . . . . . . 7 (ℎ = 𝑓 → (∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑠 ↔ ∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))
2422, 23riotaeqbidv 7381 . . . . . 6 (ℎ = 𝑓 → (℩𝑠 ∈ 𝐶 ∀𝑟 ∈ 𝐶 ¬ 𝑟𝑅𝑠) = (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))
2510, 24eqtrid 2807 . . . . 5 (ℎ = 𝑓 → (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣) = (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))
2625cbvmptv 5208 . . . 4 (ℎ ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑅𝑣)) = (𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))
272, 26eqtri 2783 . . 3 𝐺 = (𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))
28 recseq 8385 . . 3 (𝐺 = (𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠)) → recs(𝐺) = recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))))
2927, 28ax-mp 5 . 2 recs(𝐺) = recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠)))
301, 29eqtr2i 2784 1 recs((𝑓 ∈ V ↦ (℩𝑠 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦}∀𝑟 ∈ {𝑦 ∈ 𝐴 ∣ ∀𝑖 ∈ ran 𝑓 𝑖𝑅𝑦} ¬ 𝑟𝑅𝑠))) = 𝐹
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1569  ∀wral 3076  {crab 3412  Vcvv 3450   class class class wbr 5102   ↦ cmpt 5185  ran crn 5651  ℩crio 7377  recscrecs 8382
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-xp 5656  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-iota 6494  df-fv 6547  df-riota 7378  df-ov 7424  df-frecs 8303  df-wrecs 8334  df-recs 8383
This theorem is used by:  oicl  9527  oif  9528  oiiso2  9529  ordtype  9530  oiiniseg  9531  ordtype2  9532
  Copyright terms: Public domain W3C validator