![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > disjiunb | Structured version Visualization version GIF version |
Description: Two ways to say that a collection of index unions 𝐶(𝑖, 𝑥) for 𝑖 ∈ 𝐴 and 𝑥 ∈ 𝐵 is disjoint. (Contributed by AV, 9-Jan-2022.) |
Ref | Expression |
---|---|
disjiunb.1 | ⊢ (𝑖 = 𝑗 → 𝐵 = 𝐷) |
disjiunb.2 | ⊢ (𝑖 = 𝑗 → 𝐶 = 𝐸) |
Ref | Expression |
---|---|
disjiunb | ⊢ (Disj 𝑖 ∈ 𝐴 ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 = 𝑗 ∨ (∪ 𝑥 ∈ 𝐵 𝐶 ∩ ∪ 𝑥 ∈ 𝐷 𝐸) = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | disjiunb.1 | . . 3 ⊢ (𝑖 = 𝑗 → 𝐵 = 𝐷) | |
2 | disjiunb.2 | . . 3 ⊢ (𝑖 = 𝑗 → 𝐶 = 𝐸) | |
3 | 1, 2 | iuneq12d 5024 | . 2 ⊢ (𝑖 = 𝑗 → ∪ 𝑥 ∈ 𝐵 𝐶 = ∪ 𝑥 ∈ 𝐷 𝐸) |
4 | 3 | disjor 5127 | 1 ⊢ (Disj 𝑖 ∈ 𝐴 ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐴 (𝑖 = 𝑗 ∨ (∪ 𝑥 ∈ 𝐵 𝐶 ∩ ∪ 𝑥 ∈ 𝐷 𝐸) = ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∨ wo 843 = wceq 1539 ∀wral 3059 ∩ cin 3946 ∅c0 4321 ∪ ciun 4996 Disj wdisj 5112 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-11 2152 ax-ext 2701 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-mo 2532 df-clab 2708 df-cleq 2722 df-clel 2808 df-ral 3060 df-rex 3069 df-rmo 3374 df-v 3474 df-dif 3950 df-in 3954 df-ss 3964 df-nul 4322 df-iun 4998 df-disj 5113 |
This theorem is referenced by: disjiund 5137 otiunsndisj 5519 s3iunsndisj 14919 |
Copyright terms: Public domain | W3C validator |