![]() |
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 9482 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → inf(𝐴, 𝐴, 𝑅) = inf(𝐵, 𝐵, 𝑆)) |
4 | 3 | neeq2d 3000 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ↔ 𝑥 ≠ inf(𝐵, 𝐵, 𝑆))) |
5 | equid 2014 | . . . . . . 7 ⊢ 𝑥 = 𝑥 | |
6 | predeq123 6301 | . . . . . . 7 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑥 = 𝑥) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) | |
7 | 5, 6 | mp3an3 1449 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) |
8 | 7, 1, 2 | supeq123d 9451 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)) |
9 | 8 | eqeq2d 2742 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) ↔ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))) |
10 | 4, 9 | anbi12d 630 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → ((𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅)) ↔ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)))) |
11 | 1, 10 | rabeqbidv 3448 | . 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))}) |
12 | df-wlim 35104 | . 2 ⊢ WLim(𝑅, 𝐴) = {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} | |
13 | df-wlim 35104 | . 2 ⊢ WLim(𝑆, 𝐵) = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))} | |
14 | 11, 12, 13 | 3eqtr4g 2796 | 1 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ≠ wne 2939 {crab 3431 Predcpred 6299 supcsup 9441 infcinf 9442 WLimcwlim 35102 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-xp 5682 df-cnv 5684 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-sup 9443 df-inf 9444 df-wlim 35104 |
This theorem is referenced by: wlimeq1 35111 wlimeq2 35112 |
Copyright terms: Public domain | W3C validator |