Theorem dfeldisj5 39324

Description: Alternate definition of the disjoint elementhood predicate. (Contributed by Peter Mazsa, 19-Sep-2021.)

Assertion

Ref	Expression
dfeldisj5	⊢ ( ElDisj 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅))

Distinct variable group:   𝑢,𝐴,𝑣

Proof of Theorem dfeldisj5

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfeldisj4 39323	. 2 ⊢ ( ElDisj 𝐴 ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
2		inecmo2 38867	. . . 4 ⊢ ((∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ∧ Rel ◡ E ) ↔ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ∧ Rel ◡ E ))
3		relcnv 6097	. . . . 5 ⊢ Rel ◡ E
4	3	biantru 538	. . . 4 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ∧ Rel ◡ E ))
5	3	biantru 538	. . . 4 ⊢ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ∧ Rel ◡ E ))
6	2, 4, 5	3bitr4i 306	. . 3 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥)
7		eccnvep 38799	. . . . . . . 8 ⊢ (𝑢 ∈ V → [𝑢]◡ E = 𝑢)
8	7	elv 3462	. . . . . . 7 ⊢ [𝑢]◡ E = 𝑢
9		eccnvep 38799	. . . . . . . 8 ⊢ (𝑣 ∈ V → [𝑣]◡ E = 𝑣)
10	9	elv 3462	. . . . . . 7 ⊢ [𝑣]◡ E = 𝑣
11	8, 10	ineq12i 4173	. . . . . 6 ⊢ ([𝑢]◡ E ∩ [𝑣]◡ E ) = (𝑢 ∩ 𝑣)
12	11	eqeq1i 2770	. . . . 5 ⊢ (([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅ ↔ (𝑢 ∩ 𝑣) = ∅)
13	12	orbi2i 925	. . . 4 ⊢ ((𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅))
14	13	2ralbii 3140	. . 3 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅))
15		brcnvep 38781	. . . . . 6 ⊢ (𝑢 ∈ V → (𝑢◡ E 𝑥 ↔ 𝑥 ∈ 𝑢))
16	15	elv 3462	. . . . 5 ⊢ (𝑢◡ E 𝑥 ↔ 𝑥 ∈ 𝑢)
17	16	rmobii 3378	. . . 4 ⊢ (∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ ∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
18	17	albii 1842	. . 3 ⊢ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
19	6, 14, 18	3bitr3i 304	. 2 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅) ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
20	1, 19	bitr4i 281	1 ⊢ ( ElDisj 𝐴 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅))

Syntax hints:   ↔ wb 209   ∧ wa 400   ∨ wo 860  ∀wal 1561   = wceq 1563  ∀wral 3079  ∃*wrmo 3369  Vcvv 3457   ∩ cin 3906  ∅c0 4288   class class class wbr 5105   E cep 5551  ^◡ccnv 5651  Rel wrel 5657  [cec 8680   ElDisj weldisj 38732

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-id 5547  df-eprel 5552  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-ec 8684  df-coss 39012  df-cnvrefrel 39118  df-disjALTV 39301  df-eldisj 39303

This theorem is referenced by:  dfeldisj5a  39325  eqvreldisj2  39439