Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wlimeq12 Structured version   Visualization version   GIF version

Theorem wlimeq12 31009
Description: Equality theorem for the limit class. (Contributed by Scott Fenton, 15-Jun-2018.) (Proof shortened by AV, 10-Oct-2021.)
Assertion
Ref Expression
wlimeq12 ((𝑅 = 𝑆𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵))

Proof of Theorem wlimeq12
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simpr 476 . . 3 ((𝑅 = 𝑆𝐴 = 𝐵) → 𝐴 = 𝐵)
2 simpl 472 . . . . . 6 ((𝑅 = 𝑆𝐴 = 𝐵) → 𝑅 = 𝑆)
31, 1, 2infeq123d 8270 . . . . 5 ((𝑅 = 𝑆𝐴 = 𝐵) → inf(𝐴, 𝐴, 𝑅) = inf(𝐵, 𝐵, 𝑆))
43neeq2d 2842 . . . 4 ((𝑅 = 𝑆𝐴 = 𝐵) → (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ↔ 𝑥 ≠ inf(𝐵, 𝐵, 𝑆)))
5 equid 1926 . . . . . . 7 𝑥 = 𝑥
6 predeq123 5598 . . . . . . 7 ((𝑅 = 𝑆𝐴 = 𝐵𝑥 = 𝑥) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥))
75, 6mp3an3 1405 . . . . . 6 ((𝑅 = 𝑆𝐴 = 𝐵) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥))
87, 1, 2supeq123d 8239 . . . . 5 ((𝑅 = 𝑆𝐴 = 𝐵) → sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))
98eqeq2d 2620 . . . 4 ((𝑅 = 𝑆𝐴 = 𝐵) → (𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) ↔ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)))
104, 9anbi12d 743 . . 3 ((𝑅 = 𝑆𝐴 = 𝐵) → ((𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅)) ↔ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))))
111, 10rabeqbidv 3168 . 2 ((𝑅 = 𝑆𝐴 = 𝐵) → {𝑥𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} = {𝑥𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))})
12 df-wlim 31002 . 2 WLim(𝑅, 𝐴) = {𝑥𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))}
13 df-wlim 31002 . 2 WLim(𝑆, 𝐵) = {𝑥𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))}
1411, 12, 133eqtr4g 2669 1 ((𝑅 = 𝑆𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wne 2780  {crab 2900  Predcpred 5596  supcsup 8229  infcinf 8230  WLimcwlim 30998
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-xp 5044  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-sup 8231  df-inf 8232  df-wlim 31002
This theorem is referenced by:  wlimeq1  31010  wlimeq2  31011
  Copyright terms: Public domain W3C validator