| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > limeq | GIF version | ||
| Description: Equality theorem for the limit predicate. (Contributed by NM, 22-Apr-1994.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| limeq | ⊢ (𝐴 = 𝐵 → (Lim 𝐴 ↔ Lim 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordeq 4475 | . . 3 ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵)) | |
| 2 | eleq2 2295 | . . 3 ⊢ (𝐴 = 𝐵 → (∅ ∈ 𝐴 ↔ ∅ ∈ 𝐵)) | |
| 3 | id 19 | . . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵) | |
| 4 | unieq 3907 | . . . 4 ⊢ (𝐴 = 𝐵 → ∪ 𝐴 = ∪ 𝐵) | |
| 5 | 3, 4 | eqeq12d 2246 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 = ∪ 𝐴 ↔ 𝐵 = ∪ 𝐵)) |
| 6 | 1, 2, 5 | 3anbi123d 1349 | . 2 ⊢ (𝐴 = 𝐵 → ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐵 ∧ ∅ ∈ 𝐵 ∧ 𝐵 = ∪ 𝐵))) |
| 7 | dflim2 4473 | . 2 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴)) | |
| 8 | dflim2 4473 | . 2 ⊢ (Lim 𝐵 ↔ (Ord 𝐵 ∧ ∅ ∈ 𝐵 ∧ 𝐵 = ∪ 𝐵)) | |
| 9 | 6, 7, 8 | 3bitr4g 223 | 1 ⊢ (𝐴 = 𝐵 → (Lim 𝐴 ↔ Lim 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ∅c0 3496 ∪ cuni 3898 Ord word 4465 Lim wlim 4467 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-in 3207 df-ss 3214 df-uni 3899 df-tr 4193 df-iord 4469 df-ilim 4472 |
| This theorem is referenced by: limuni2 4500 |
| Copyright terms: Public domain | W3C validator |