Theorem dfeldisj5 39443

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 39442	. 2 ⊢ ( ElDisj 𝐴 ↔ ∀𝑥∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
2		inecmo2 38986	. . . 4 ⊢ ((∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ∧ Rel ◡ E ) ↔ (∀𝑥∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ∧ Rel ◡ E ))
3		relcnv 6108	. . . . 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 38918	. . . . . . . 8 ⊢ (𝑢 ∈ V → [𝑢]◡ E = 𝑢)
8	7	elv 3460	. . . . . . 7 ⊢ [𝑢]◡ E = 𝑢
9		eccnvep 38918	. . . . . . . 8 ⊢ (𝑣 ∈ V → [𝑣]◡ E = 𝑣)
10	9	elv 3460	. . . . . . 7 ⊢ [𝑣]◡ E = 𝑣
11	8, 10	ineq12i 4172	. . . . . 6 ⊢ ([𝑢]◡ E ∩ [𝑣]◡ E ) = (𝑢 ∩ 𝑣)
12	11	eqeq1i 2768	. . . . 5 ⊢ (([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅ ↔ (𝑢 ∩ 𝑣) = ∅)
13	12	orbi2i 925	. . . 4 ⊢ ((𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅))
14	13	2ralbii 3140	. . 3 ⊢ (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ ([𝑢]◡ E ∩ [𝑣]◡ E ) = ∅) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ∨ (𝑢 ∩ 𝑣) = ∅))
15		brcnvep 38900	. . . . . 6 ⊢ (𝑢 ∈ V → (𝑢◡ E 𝑥 ↔ 𝑥 ∈ 𝑢))
16	15	elv 3460	. . . . 5 ⊢ (𝑢◡ E 𝑥 ↔ 𝑥 ∈ 𝑢)
17	16	rmobii 3377	. . . 4 ⊢ (∃*𝑢 ∈ 𝐴 𝑢◡ E 𝑥 ↔ ∃*𝑢 ∈ 𝐴 𝑥 ∈ 𝑢)
18	17	albii 1849	. . 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 1568   = wceq 1570  ∀wral 3079  ∃*wrmo 3368  Vcvv 3455   ∩ cin 3905  ∅c0 4287   class class class wbr 5110   E cep 5562  ^◡ccnv 5662  Rel wrel 5668  [cec 8693   ElDisj weldisj 38851

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-id 5558  df-eprel 5563  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ec 8697  df-coss 39131  df-cnvrefrel 39237  df-disjALTV 39420  df-eldisj 39422

This theorem is referenced by:  dfeldisj5a  39444  eqvreldisj2  39558