Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > uniinn0 | Structured version Visualization version GIF version |
Description: Sufficient and necessary condition for a union to intersect with a given set. (Contributed by Thierry Arnoux, 27-Jan-2020.) |
Ref | Expression |
---|---|
uniinn0 | ⊢ ((∪ 𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nne 3020 | . . . 4 ⊢ (¬ (𝑥 ∩ 𝐵) ≠ ∅ ↔ (𝑥 ∩ 𝐵) = ∅) | |
2 | 1 | ralbii 3165 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ (𝑥 ∩ 𝐵) ≠ ∅ ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = ∅) |
3 | ralnex 3236 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ (𝑥 ∩ 𝐵) ≠ ∅ ↔ ¬ ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) ≠ ∅) | |
4 | unissb 4869 | . . . 4 ⊢ (∪ 𝐴 ⊆ (V ∖ 𝐵) ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ (V ∖ 𝐵)) | |
5 | disj2 4406 | . . . 4 ⊢ ((∪ 𝐴 ∩ 𝐵) = ∅ ↔ ∪ 𝐴 ⊆ (V ∖ 𝐵)) | |
6 | disj2 4406 | . . . . 5 ⊢ ((𝑥 ∩ 𝐵) = ∅ ↔ 𝑥 ⊆ (V ∖ 𝐵)) | |
7 | 6 | ralbii 3165 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ (V ∖ 𝐵)) |
8 | 4, 5, 7 | 3bitr4ri 306 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) = ∅ ↔ (∪ 𝐴 ∩ 𝐵) = ∅) |
9 | 2, 3, 8 | 3bitr3i 303 | . 2 ⊢ (¬ ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) ≠ ∅ ↔ (∪ 𝐴 ∩ 𝐵) = ∅) |
10 | 9 | necon1abii 3064 | 1 ⊢ ((∪ 𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐵) ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 208 = wceq 1533 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 Vcvv 3494 ∖ cdif 3932 ∩ cin 3934 ⊆ wss 3935 ∅c0 4290 ∪ cuni 4837 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-v 3496 df-dif 3938 df-in 3942 df-ss 3951 df-nul 4291 df-uni 4838 |
This theorem is referenced by: locfinreflem 31104 |
Copyright terms: Public domain | W3C validator |