| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjord | Structured version Visualization version GIF version | ||
| Description: Conditions for a collection of sets 𝐴(𝑎) for 𝑎 ∈ 𝑉 to be disjoint. (Contributed by AV, 9-Jan-2022.) |
| Ref | Expression |
|---|---|
| disjord.1 | ⊢ (𝑎 = 𝑏 → 𝐴 = 𝐵) |
| disjord.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) → 𝑎 = 𝑏) |
| Ref | Expression |
|---|---|
| disjord | ⊢ (𝜑 → Disj 𝑎 ∈ 𝑉 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orc 881 | . . . . . 6 ⊢ (𝑎 = 𝑏 → (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅)) | |
| 2 | 1 | a1d 26 | . . . . 5 ⊢ (𝑎 = 𝑏 → (𝜑 → (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅))) |
| 3 | disjord.2 | . . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) → 𝑎 = 𝑏) | |
| 4 | 3 | 3expia 1139 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐵 → 𝑎 = 𝑏)) |
| 5 | 4 | con3d 153 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (¬ 𝑎 = 𝑏 → ¬ 𝑥 ∈ 𝐵)) |
| 6 | 5 | impancom 457 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝑎 = 𝑏) → (𝑥 ∈ 𝐴 → ¬ 𝑥 ∈ 𝐵)) |
| 7 | 6 | ralrimiv 3158 | . . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑎 = 𝑏) → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) |
| 8 | disj 4410 | . . . . . . . 8 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝐵) | |
| 9 | 7, 8 | sylibr 237 | . . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑎 = 𝑏) → (𝐴 ∩ 𝐵) = ∅) |
| 10 | 9 | olcd 888 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑎 = 𝑏) → (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅)) |
| 11 | 10 | expcom 419 | . . . . 5 ⊢ (¬ 𝑎 = 𝑏 → (𝜑 → (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅))) |
| 12 | 2, 11 | pm2.61i 184 | . . . 4 ⊢ (𝜑 → (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅)) |
| 13 | 12 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅)) |
| 14 | 13 | ralrimivva 3210 | . 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅)) |
| 15 | disjord.1 | . . 3 ⊢ (𝑎 = 𝑏 → 𝐴 = 𝐵) | |
| 16 | 15 | disjor 5093 | . 2 ⊢ (Disj 𝑎 ∈ 𝑉 𝐴 ↔ ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 (𝑎 = 𝑏 ∨ (𝐴 ∩ 𝐵) = ∅)) |
| 17 | 14, 16 | sylibr 237 | 1 ⊢ (𝜑 → Disj 𝑎 ∈ 𝑉 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∩ cin 3905 ∅c0 4286 Disj wdisj 5078 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-11 2195 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2569 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rmo 3371 df-v 3459 df-dif 3909 df-in 3913 df-nul 4287 df-disj 5079 |
| This theorem is used by: 2wspdisj 30381 |
| Copyright terms: Public domain | W3C validator |