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 487 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
2 | simpl 485 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → 𝑅 = 𝑆) | |
3 | 1, 1, 2 | infeq123d 8945 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → inf(𝐴, 𝐴, 𝑅) = inf(𝐵, 𝐵, 𝑆)) |
4 | 3 | neeq2d 3076 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ↔ 𝑥 ≠ inf(𝐵, 𝐵, 𝑆))) |
5 | equid 2019 | . . . . . . 7 ⊢ 𝑥 = 𝑥 | |
6 | predeq123 6149 | . . . . . . 7 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑥 = 𝑥) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) | |
7 | 5, 6 | mp3an3 1446 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) |
8 | 7, 1, 2 | supeq123d 8914 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)) |
9 | 8 | eqeq2d 2832 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) ↔ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))) |
10 | 4, 9 | anbi12d 632 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → ((𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅)) ↔ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)))) |
11 | 1, 10 | rabeqbidv 3485 | . 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))}) |
12 | df-wlim 33100 | . 2 ⊢ WLim(𝑅, 𝐴) = {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} | |
13 | df-wlim 33100 | . 2 ⊢ WLim(𝑆, 𝐵) = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))} | |
14 | 11, 12, 13 | 3eqtr4g 2881 | 1 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ≠ wne 3016 {crab 3142 Predcpred 6147 supcsup 8904 infcinf 8905 WLimcwlim 33098 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-xp 5561 df-cnv 5563 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-sup 8906 df-inf 8907 df-wlim 33100 |
This theorem is referenced by: wlimeq1 33107 wlimeq2 33108 |
Copyright terms: Public domain | W3C validator |