| 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 2374 | . . 3 ⊢ Ⅎ𝑖𝐵 | |
| 2 | nfcsb1v 3160 | . . 3 ⊢ Ⅎ𝑥⦋𝑖 / 𝑥⦌𝐵 | |
| 3 | csbeq1a 3136 | . . 3 ⊢ (𝑥 = 𝑖 → 𝐵 = ⦋𝑖 / 𝑥⦌𝐵) | |
| 4 | 1, 2, 3 | cbvdisj 4074 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑖 ∈ 𝐴 ⦋𝑖 / 𝑥⦌𝐵) |
| 5 | csbeq1 3130 | . . 3 ⊢ (𝑖 = 𝑗 → ⦋𝑖 / 𝑥⦌𝐵 = ⦋𝑗 / 𝑥⦌𝐵) | |
| 6 | 5 | disjnim 4078 | . 2 ⊢ (Disj 𝑖 ∈ 𝐴 ⦋𝑖 / 𝑥⦌𝐵 → ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 ≠ 𝑗 → (⦋𝑖 / 𝑥⦌𝐵 ∩ ⦋𝑗 / 𝑥⦌𝐵) = ∅)) |
| 7 | 4, 6 | sylbi 121 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 → ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 ≠ 𝑗 → (⦋𝑖 / 𝑥⦌𝐵 ∩ ⦋𝑗 / 𝑥⦌𝐵) = ∅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ≠ wne 2402 ∀wral 2510 ⦋csb 3127 ∩ cin 3199 ∅c0 3494 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-in1 619 ax-in2 620 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-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-in 3206 df-nul 3495 df-disj 4065 |
| This theorem is referenced by: disji2 4080 |
| Copyright terms: Public domain | W3C validator |