| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfeldisj5 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the disjoint elementhood predicate. (Contributed by Peter Mazsa, 19-Sep-2021.) |
| Ref | Expression |
|---|---|
| dfeldisj5 | ⊢ ( ElDisj 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfeldisj4 39568 | . 2 ⊢ ( ElDisj 𝐴 ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) | |
| 2 | inecmo2 39112 | . . . 4 ⊢ ((∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ∧ Rel ◡ E ) ↔ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ∧ Rel ◡ E )) | |
| 3 | relcnv 6104 | . . . . 5 ⊢ Rel ◡ E | |
| 4 | 3 | biantru 539 | . . . 4 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ∧ Rel ◡ E )) |
| 5 | 3 | biantru 539 | . . . 4 ⊢ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ∧ Rel ◡ E )) |
| 6 | 2, 4, 5 | 3bitr4i 306 | . . 3 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥) |
| 7 | eccnvep 39044 | . . . . . . . 8 ⊢ (𝑢 ∈ V → [𝑢]◡ E = 𝑢) | |
| 8 | 7 | elv 3458 | . . . . . . 7 ⊢ [𝑢]◡ E = 𝑢 |
| 9 | eccnvep 39044 | . . . . . . . 8 ⊢ (𝑣 ∈ V → [𝑣]◡ E = 𝑣) | |
| 10 | 9 | elv 3458 | . . . . . . 7 ⊢ [𝑣]◡ E = 𝑣 |
| 11 | 8, 10 | ineq12i 4167 | . . . . . 6 ⊢ ([𝑢]◡ E ∩ [𝑣]◡ E ) = (𝑢 ∩ 𝑣) |
| 12 | 11 | eqeq1i 2767 | . . . . 5 ⊢ (([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅ ↔ (𝑢 ∩ 𝑣) = ∅) |
| 13 | 12 | orbi2i 926 | . . . 4 ⊢ ((𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅)) |
| 14 | 13 | 2ralbii 3139 | . . 3 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅)) |
| 15 | brcnvep 39026 | . . . . . 6 ⊢ (𝑢 ∈ V → (𝑢◡ E 𝑥 ↔ 𝑥 ∈ 𝑢)) | |
| 16 | 15 | elv 3458 | . . . . 5 ⊢ (𝑢◡ E 𝑥 ↔ 𝑥 ∈ 𝑢) |
| 17 | 16 | rmobii 3375 | . . . 4 ⊢ (∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ ∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) |
| 18 | 17 | albii 1852 | . . 3 ⊢ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) |
| 19 | 6, 14, 18 | 3bitr3i 304 | . 2 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅) ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢) |
| 20 | 1, 19 | bitr4i 281 | 1 ⊢ ( ElDisj 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∨ wo 861 ∀wal 1568 = wceq 1570 ∀wral 3078 ∃*wrmo 3366 Vcvv 3453 ∩ cin 3901 ∅c0 4282 class class class wbr 5107 E cep 5558 ◡ccnv 5658 Rel wrel 5664 [cec 8698 ElDisj weldisj 38977 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-eprel 5559 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ec 8702 df-coss 39257 df-cnvrefrel 39363 df-disjALTV 39546 df-eldisj 39548 |
| This theorem is used by: dfeldisj5a 39570 eqvreldisj2 39684 |
| Copyright terms: Public domain | W3C validator |