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

Theorem wrecseq123OLD 8340
Description: Obsolete version of wrecseq123 8339 as of 17-Nov-2024. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by Scott Fenton, 7-Jun-2018.)
Assertion
Ref Expression
wrecseq123OLD ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → wrecs(𝑅, 𝐴, 𝐹) = wrecs(𝑆, 𝐵, 𝐺))

Proof of Theorem wrecseq123OLD
Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq2 4010 . . . . . . . 8 (𝐴 = 𝐵 → (𝑥𝐴𝑥𝐵))
213ad2ant2 1135 . . . . . . 7 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (𝑥𝐴𝑥𝐵))
3 predeq1 6323 . . . . . . . . . . 11 (𝑅 = 𝑆 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑆, 𝐴, 𝑦))
4 predeq2 6324 . . . . . . . . . . 11 (𝐴 = 𝐵 → Pred(𝑆, 𝐴, 𝑦) = Pred(𝑆, 𝐵, 𝑦))
53, 4sylan9eq 2797 . . . . . . . . . 10 ((𝑅 = 𝑆𝐴 = 𝐵) → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑆, 𝐵, 𝑦))
653adant3 1133 . . . . . . . . 9 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑆, 𝐵, 𝑦))
76sseq1d 4015 . . . . . . . 8 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥 ↔ Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥))
87ralbidv 3178 . . . . . . 7 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥 ↔ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥))
92, 8anbi12d 632 . . . . . 6 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → ((𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ↔ (𝑥𝐵 ∧ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥)))
10 simp3 1139 . . . . . . . . 9 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → 𝐹 = 𝐺)
115reseq2d 5997 . . . . . . . . . 10 ((𝑅 = 𝑆𝐴 = 𝐵) → (𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝑓 ↾ Pred(𝑆, 𝐵, 𝑦)))
12113adant3 1133 . . . . . . . . 9 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝑓 ↾ Pred(𝑆, 𝐵, 𝑦)))
1310, 12fveq12d 6913 . . . . . . . 8 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦))))
1413eqeq2d 2748 . . . . . . 7 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → ((𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦)))))
1514ralbidv 3178 . . . . . 6 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦)))))
169, 153anbi23d 1441 . . . . 5 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → ((𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ (𝑓 Fn 𝑥 ∧ (𝑥𝐵 ∧ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦))))))
1716exbidv 1921 . . . 4 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → (∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐵 ∧ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦))))))
1817abbidv 2808 . . 3 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐵 ∧ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦))))})
1918unieqd 4920 . 2 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐵 ∧ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦))))})
20 dfwrecsOLD 8338 . 2 wrecs(𝑅, 𝐴, 𝐹) = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
21 dfwrecsOLD 8338 . 2 wrecs(𝑆, 𝐵, 𝐺) = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐵 ∧ ∀𝑦𝑥 Pred(𝑆, 𝐵, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑆, 𝐵, 𝑦))))}
2219, 20, 213eqtr4g 2802 1 ((𝑅 = 𝑆𝐴 = 𝐵𝐹 = 𝐺) → wrecs(𝑅, 𝐴, 𝐹) = wrecs(𝑆, 𝐵, 𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1540  wex 1779  {cab 2714  wral 3061  wss 3951   cuni 4907  cres 5687  Predcpred 6320   Fn wfn 6556  cfv 6561  wrecscwrecs 8336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-fo 6567  df-fv 6569  df-ov 7434  df-2nd 8015  df-frecs 8306  df-wrecs 8337
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator