Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > disjnims | GIF version |
Description: If a collection 𝐵(𝑖) for 𝑖 ∈ 𝐴 is disjoint, then pairs are disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by Jim Kingdon, 7-Oct-2022.) |
Ref | Expression |
---|---|
disjnims | ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 ≠ 𝑗 → (⦋𝑖 / 𝑥⦌𝐵 ∩ ⦋𝑗 / 𝑥⦌𝐵) = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2308 | . . 3 ⊢ Ⅎ𝑖𝐵 | |
2 | nfcsb1v 3078 | . . 3 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵 | |
3 | csbeq1a 3054 | . . 3 ⊢ (𝑥 = 𝑖 → 𝐵 = ⦋𝑖 / 𝑥⦌𝐵) | |
4 | 1, 2, 3 | cbvdisj 3969 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑖 ∈ 𝐴 ⦋𝑖 / 𝑥⦌𝐵) |
5 | csbeq1 3048 | . . 3 ⊢ (𝑖 = 𝑗 → ⦋𝑖 / 𝑥⦌𝐵 = ⦋𝑗 / 𝑥⦌𝐵) | |
6 | 5 | disjnim 3973 | . 2 ⊢ (Disj 𝑖 ∈ 𝐴 ⦋𝑖 / 𝑥⦌𝐵 → ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 ≠ 𝑗 → (⦋𝑖 / 𝑥⦌𝐵 ∩ ⦋𝑗 / 𝑥⦌𝐵) = ∅)) |
7 | 4, 6 | sylbi 120 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 ≠ 𝑗 → (⦋𝑖 / 𝑥⦌𝐵 ∩ ⦋𝑗 / 𝑥⦌𝐵) = ∅)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1343 ≠ wne 2336 ∀wral 2444 ⦋csb 3045 ∩ cin 3115 ∅c0 3409 Disj wdisj 3959 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-v 2728 df-sbc 2952 df-csb 3046 df-dif 3118 df-in 3122 df-nul 3410 df-disj 3960 |
This theorem is referenced by: disji2 3975 |
Copyright terms: Public domain | W3C validator |