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 4127 | . . 3 ⊢ (𝐴 = 𝐵 → (Ord 𝐴 ↔ Ord 𝐵)) | |
2 | eleq2 2142 | . . 3 ⊢ (𝐴 = 𝐵 → (∅ ∈ 𝐴 ↔ ∅ ∈ 𝐵)) | |
3 | id 19 | . . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 = 𝐵) | |
4 | unieq 3610 | . . . 4 ⊢ (𝐴 = 𝐵 → ∪ 𝐴 = ∪ 𝐵) | |
5 | 3, 4 | eqeq12d 2095 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 = ∪ 𝐴 ↔ 𝐵 = ∪ 𝐵)) |
6 | 1, 2, 5 | 3anbi123d 1243 | . 2 ⊢ (𝐴 = 𝐵 → ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐵 ∧ ∅ ∈ 𝐵 ∧ 𝐵 = ∪ 𝐵))) |
7 | dflim2 4125 | . 2 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴)) | |
8 | dflim2 4125 | . 2 ⊢ (Lim 𝐵 ↔ (Ord 𝐵 ∧ ∅ ∈ 𝐵 ∧ 𝐵 = ∪ 𝐵)) | |
9 | 6, 7, 8 | 3bitr4g 221 | 1 ⊢ (𝐴 = 𝐵 → (Lim 𝐴 ↔ Lim 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 ∧ w3a 919 = wceq 1284 ∈ wcel 1433 ∅c0 3251 ∪ cuni 3601 Ord word 4117 Lim wlim 4119 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-in 2979 df-ss 2986 df-uni 3602 df-tr 3876 df-iord 4121 df-ilim 4124 |
This theorem is referenced by: limuni2 4152 |
Copyright terms: Public domain | W3C validator |