| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > wlimeq12 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the limit class. (Contributed by Scott Fenton, 15-Jun-2018.) (Proof shortened by AV, 10-Oct-2021.) |
| Ref | Expression |
|---|---|
| wlimeq12 | ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 484 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 2 | simpl 482 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → 𝑅 = 𝑆) | |
| 3 | 1, 1, 2 | infeq123d 9361 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → inf(𝐴, 𝐴, 𝑅) = inf(𝐵, 𝐵, 𝑆)) |
| 4 | 3 | neeq2d 2988 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ↔ 𝑥 ≠ inf(𝐵, 𝐵, 𝑆))) |
| 5 | equid 2013 | . . . . . . 7 ⊢ 𝑥 = 𝑥 | |
| 6 | predeq123 6244 | . . . . . . 7 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑥 = 𝑥) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) | |
| 7 | 5, 6 | mp3an3 1452 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) |
| 8 | 7, 1, 2 | supeq123d 9329 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)) |
| 9 | 8 | eqeq2d 2742 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) ↔ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))) |
| 10 | 4, 9 | anbi12d 632 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → ((𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅)) ↔ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)))) |
| 11 | 1, 10 | rabeqbidv 3413 | . 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))}) |
| 12 | df-wlim 35847 | . 2 ⊢ WLim(𝑅, 𝐴) = {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} | |
| 13 | df-wlim 35847 | . 2 ⊢ WLim(𝑆, 𝐵) = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))} | |
| 14 | 11, 12, 13 | 3eqtr4g 2791 | 1 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ≠ wne 2928 {crab 3395 Predcpred 6242 supcsup 9319 infcinf 9320 WLimcwlim 35845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4279 df-if 4471 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-br 5087 df-opab 5149 df-xp 5617 df-cnv 5619 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-pred 6243 df-sup 9321 df-inf 9322 df-wlim 35847 |
| This theorem is referenced by: wlimeq1 35854 wlimeq2 35855 |
| Copyright terms: Public domain | W3C validator |