| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > disjeq2 | GIF version | ||
| Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| disjeq2 | ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqimss2 3282 | . . . 4 ⊢ (𝐵 = 𝐶 → 𝐶 ⊆ 𝐵) | |
| 2 | 1 | ralimi 2595 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵) |
| 3 | disjss2 4067 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐴 𝐶)) | |
| 4 | 2, 3 | syl 14 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐴 𝐶)) |
| 5 | eqimss 3281 | . . . 4 ⊢ (𝐵 = 𝐶 → 𝐵 ⊆ 𝐶) | |
| 6 | 5 | ralimi 2595 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶) |
| 7 | disjss2 4067 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵)) | |
| 8 | 6, 7 | syl 14 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵)) |
| 9 | 4, 8 | impbid 129 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1397 ∀wral 2510 ⊆ wss 3200 Disj wdisj 4064 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-ral 2515 df-rmo 2518 df-in 3206 df-ss 3213 df-disj 4065 |
| This theorem is referenced by: disjeq2dv 4069 |
| Copyright terms: Public domain | W3C validator |