| 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 490 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 2 | simpl 488 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → 𝑅 = 𝑆) | |
| 3 | 1, 1, 2 | infeq123d 9484 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → inf(𝐴, 𝐴, 𝑅) = inf(𝐵, 𝐵, 𝑆)) |
| 4 | 3 | neeq2d 3018 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ↔ 𝑥 ≠ inf(𝐵, 𝐵, 𝑆))) |
| 5 | equid 2046 | . . . . . . 7 ⊢ 𝑥 = 𝑥 | |
| 6 | predeq123 6311 | . . . . . . 7 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝑥 = 𝑥) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) | |
| 7 | 5, 6 | mp3an3 1479 | . . . . . 6 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑆, 𝐵, 𝑥)) |
| 8 | 7, 1, 2 | supeq123d 9452 | . . . . 5 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)) |
| 9 | 8 | eqeq2d 2774 | . . . 4 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → (𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅) ↔ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))) |
| 10 | 4, 9 | anbi12d 644 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → ((𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅)) ↔ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆)))) |
| 11 | 1, 10 | rabeqbidv 3432 | . 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))}) |
| 12 | df-wlim 36702 | . 2 ⊢ WLim(𝑅, 𝐴) = {𝑥 ∈ 𝐴 ∣ (𝑥 ≠ inf(𝐴, 𝐴, 𝑅) ∧ 𝑥 = sup(Pred(𝑅, 𝐴, 𝑥), 𝐴, 𝑅))} | |
| 13 | df-wlim 36702 | . 2 ⊢ WLim(𝑆, 𝐵) = {𝑥 ∈ 𝐵 ∣ (𝑥 ≠ inf(𝐵, 𝐵, 𝑆) ∧ 𝑥 = sup(Pred(𝑆, 𝐵, 𝑥), 𝐵, 𝑆))} | |
| 14 | 11, 12, 13 | 3eqtr4g 2823 | 1 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵) → WLim(𝑅, 𝐴) = WLim(𝑆, 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ≠ wne 2958 {crab 3415 Predcpred 6309 supcsup 9442 infcinf 9443 WLimcwlim 36700 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-xp 5660 df-cnv 5662 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-sup 9444 df-inf 9445 df-wlim 36702 |
| This theorem is used by: wlimeq1 36709 wlimeq2 36710 |
| Copyright terms: Public domain | W3C validator |