| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjeq1d | Structured version Visualization version GIF version | ||
| Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| disjeq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| disjeq1d | ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjeq1d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | disjeq1 5088 | . 2 ⊢ (𝐴 = 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶)) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1568 Disj wdisj 5081 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1808 df-mo 2574 df-cleq 2762 df-clel 2845 df-rmo 3376 df-ss 3930 df-disj 5082 |
| This theorem is referenced by: disjeq12d 5090 disjxiun 5111 disjdifprg 32890 disjdifprg2 32891 disjun0 32910 tocyccntz 33434 measxun2 34570 measssd 34575 meadjun 47128 |
| Copyright terms: Public domain | W3C validator |