| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > untuni | Structured version Visualization version GIF version | ||
| Description: The union of a class is untangled iff all its members are untangled. (Contributed by Scott Fenton, 28-Feb-2011.) |
| Ref | Expression |
|---|---|
| untuni | ⊢ (∀𝑥 ∈ ∪ 𝐴 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r19.23v 3167 | . . . 4 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥) ↔ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) | |
| 2 | 1 | albii 1826 | . . 3 ⊢ (∀𝑥∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) |
| 3 | ralcom4 3266 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑥∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) | |
| 4 | eluni2 4849 | . . . . 5 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦) | |
| 5 | 4 | imbi1i 350 | . . . 4 ⊢ ((𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥) ↔ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) |
| 6 | 5 | albii 1826 | . . 3 ⊢ (∀𝑥(𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) |
| 7 | 2, 3, 6 | 3bitr4ri 305 | . 2 ⊢ (∀𝑥(𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑦 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) |
| 8 | df-ral 3055 | . 2 ⊢ (∀𝑥 ∈ ∪ 𝐴 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑥(𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥)) | |
| 9 | df-ral 3055 | . . 3 ⊢ (∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) | |
| 10 | 9 | ralbii 3086 | . 2 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥)) |
| 11 | 7, 8, 10 | 3bitr4i 304 | 1 ⊢ (∀𝑥 ∈ ∪ 𝐴 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∀wal 1545 ∈ wcel 2119 ∀wral 3054 ∃wrex 3064 ∪ cuni 4845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-11 2168 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-rex 3065 df-v 3434 df-uni 4846 |
| This theorem is referenced by: untangtr 35949 dfon2lem3 36018 dfon2lem7 36022 |
| Copyright terms: Public domain | W3C validator |