| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > disji2 | GIF version | ||
| Description: Property of a disjoint collection: if 𝐵(𝑋) = 𝐶 and 𝐵(𝑌) = 𝐷, and 𝑋 ≠ 𝑌, then 𝐶 and 𝐷 are disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| disji.1 | ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐶) |
| disji.2 | ⊢ (𝑥 = 𝑌 → 𝐵 = 𝐷) |
| Ref | Expression |
|---|---|
| disji2 | ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑋 ≠ 𝑌) → (𝐶 ∩ 𝐷) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjnims 4116 | . . 3 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦 ≠ 𝑧 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅)) | |
| 2 | neeq1 2433 | . . . . 5 ⊢ (𝑦 = 𝑋 → (𝑦 ≠ 𝑧 ↔ 𝑋 ≠ 𝑧)) | |
| 3 | nfcv 2392 | . . . . . . . 8 ⊢ Ⅎ𝑥𝑋 | |
| 4 | nfcv 2392 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐶 | |
| 5 | disji.1 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐶) | |
| 6 | 3, 4, 5 | csbhypf 3186 | . . . . . . 7 ⊢ (𝑦 = 𝑋 → ⦋𝑦 / 𝑥⦌𝐵 = 𝐶) |
| 7 | 6 | ineq1d 3431 | . . . . . 6 ⊢ (𝑦 = 𝑋 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵)) |
| 8 | 7 | eqeq1d 2247 | . . . . 5 ⊢ (𝑦 = 𝑋 → ((⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅ ↔ (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅)) |
| 9 | 2, 8 | imbi12d 234 | . . . 4 ⊢ (𝑦 = 𝑋 → ((𝑦 ≠ 𝑧 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅) ↔ (𝑋 ≠ 𝑧 → (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅))) |
| 10 | neeq2 2434 | . . . . 5 ⊢ (𝑧 = 𝑌 → (𝑋 ≠ 𝑧 ↔ 𝑋 ≠ 𝑌)) | |
| 11 | nfcv 2392 | . . . . . . . 8 ⊢ Ⅎ𝑥𝑌 | |
| 12 | nfcv 2392 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐷 | |
| 13 | disji.2 | . . . . . . . 8 ⊢ (𝑥 = 𝑌 → 𝐵 = 𝐷) | |
| 14 | 11, 12, 13 | csbhypf 3186 | . . . . . . 7 ⊢ (𝑧 = 𝑌 → ⦋𝑧 / 𝑥⦌𝐵 = 𝐷) |
| 15 | 14 | ineq2d 3432 | . . . . . 6 ⊢ (𝑧 = 𝑌 → (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = (𝐶 ∩ 𝐷)) |
| 16 | 15 | eqeq1d 2247 | . . . . 5 ⊢ (𝑧 = 𝑌 → ((𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅ ↔ (𝐶 ∩ 𝐷) = ∅)) |
| 17 | 10, 16 | imbi12d 234 | . . . 4 ⊢ (𝑧 = 𝑌 → ((𝑋 ≠ 𝑧 → (𝐶 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅) ↔ (𝑋 ≠ 𝑌 → (𝐶 ∩ 𝐷) = ∅))) |
| 18 | 9, 17 | rspc2v 2943 | . . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦 ≠ 𝑧 → (⦋𝑦 / 𝑥⦌𝐵 ∩ ⦋𝑧 / 𝑥⦌𝐵) = ∅) → (𝑋 ≠ 𝑌 → (𝐶 ∩ 𝐷) = ∅))) |
| 19 | 1, 18 | mpan9 281 | . 2 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (𝑋 ≠ 𝑌 → (𝐶 ∩ 𝐷) = ∅)) |
| 20 | 19 | 3impia 1231 | 1 ⊢ ((Disj 𝑥 ∈ 𝐴 𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑋 ≠ 𝑌) → (𝐶 ∩ 𝐷) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∀wral 2528 ⦋csb 3147 ∩ cin 3219 ∅c0 3520 Disj wdisj 4101 |
| 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-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-in 3226 df-nul 3521 df-disj 4102 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |