| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfdisj2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition for disjoint classes. (Contributed by NM, 17-Jun-2017.) |
| Ref | Expression |
|---|---|
| dfdisj2 | ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-disj 5070 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 2 | df-rmo 3365 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 3 | 2 | albii 1851 | . 2 ⊢ (∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 4 | 1, 3 | bitri 278 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∀wal 1567 ∈ wcel 2144 ∃*wmo 2562 ∃*wrmo 3364 Disj wdisj 5069 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 |
| This proof depends on definitions: df-bi 210 df-rmo 3365 df-disj 5070 |
| This theorem is used by: disjss1 5075 nfdisjw 5081 nfdisj 5082 invdisj 5088 sndisj 5094 disjxsn 5096 disjss3 5101 vitalilem3 25937 |
| Copyright terms: Public domain | W3C validator |