| 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 4407 | . . 3 ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵)) | |
| 2 | eleq2 2260 | . . 3 ⊢ (𝐴 = 𝐵 → (∅ ∈ 𝐴 ↔ ∅ ∈ 𝐵)) | |
| 3 | id 19 | . . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵) | |
| 4 | unieq 3848 | . . . 4 ⊢ (𝐴 = 𝐵 → ∪ 𝐴 = ∪ 𝐵) | |
| 5 | 3, 4 | eqeq12d 2211 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 = ∪ 𝐴 ↔ 𝐵 = ∪ 𝐵)) |
| 6 | 1, 2, 5 | 3anbi123d 1323 | . 2 ⊢ (𝐴 = 𝐵 → ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐵 ∧ ∅ ∈ 𝐵 ∧ 𝐵 = ∪ 𝐵))) |
| 7 | dflim2 4405 | . 2 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴)) | |
| 8 | dflim2 4405 | . 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 980 = wceq 1364 ∈ wcel 2167 ∅c0 3450 ∪ cuni 3839 Ord word 4397 Lim wlim 4399 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-in 3163 df-ss 3170 df-uni 3840 df-tr 4132 df-iord 4401 df-ilim 4404 |
| This theorem is referenced by: limuni2 4432 |
| Copyright terms: Public domain | W3C validator |