New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > iuneq1d | GIF version |
Description: Equality theorem for indexed union, deduction version. (Contributed by Drahflow, 22-Oct-2015.) |
Ref | Expression |
---|---|
iuneq1d.1 | ⊢ (φ → A = B) |
Ref | Expression |
---|---|
iuneq1d | ⊢ (φ → ∪x ∈ A C = ∪x ∈ B C) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iuneq1d.1 | . 2 ⊢ (φ → A = B) | |
2 | iuneq1 3982 | . 2 ⊢ (A = B → ∪x ∈ A C = ∪x ∈ B C) | |
3 | 1, 2 | syl 15 | 1 ⊢ (φ → ∪x ∈ A C = ∪x ∈ B C) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1642 ∪ciun 3969 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-nan 1288 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2478 df-ral 2619 df-rex 2620 df-v 2861 df-nin 3211 df-compl 3212 df-in 3213 df-ss 3259 df-iun 3971 |
This theorem is referenced by: iuneq12d 3993 |
Copyright terms: Public domain | W3C validator |