| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > uneq1 | GIF version | ||
| Description: Equality theorem for union of two classes. (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| uneq1 | ⊢ (𝐴 = 𝐵 → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2293 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 2 | 1 | orbi1d 796 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))) |
| 3 | elun 3346 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐶) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐶)) | |
| 4 | elun 3346 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∪ 𝐶) ↔ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶)) | |
| 5 | 2, 3, 4 | 3bitr4g 223 | . 2 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ (𝐴 ∪ 𝐶) ↔ 𝑥 ∈ (𝐵 ∪ 𝐶))) |
| 6 | 5 | eqrdv 2227 | 1 ⊢ (𝐴 = 𝐵 → (𝐴 ∪ 𝐶) = (𝐵 ∪ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ∪ cun 3196 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2802 df-un 3202 |
| This theorem is referenced by: uneq2 3353 uneq12 3354 uneq1i 3355 uneq1d 3358 prprc1 3778 uniprg 3906 exmid1stab 4296 unexb 4537 relresfld 5264 relcoi1 5266 rdgeq2 6533 xpider 6770 findcard2 7071 findcard2s 7072 unfiexmid 7103 plyval 15446 bdunexb 16451 bj-unexg 16452 |
| Copyright terms: Public domain | W3C validator |