Theorem inecmo3 38403

Description: Equivalence of a double universal quantification restricted to the domain and an "at most one" inside a universal quantification. (Contributed by Peter Mazsa, 5-Sep-2021.)

Assertion

Ref	Expression
inecmo3	⊢ ((∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(𝑢 = 𝑣 ∨ ([𝑢]𝑅 ∩ [𝑣]𝑅) = ∅) ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 𝑢𝑅𝑥 ∧ Rel 𝑅))

Distinct variable group:   𝑢,𝑅,𝑣,𝑥

Proof of Theorem inecmo3

Step	Hyp	Ref	Expression
1		inecmo2 38398	. 2 ⊢ ((∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(𝑢 = 𝑣 ∨ ([𝑢]𝑅 ∩ [𝑣]𝑅) = ∅) ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ∧ Rel 𝑅))
2		alrmomodm 38401	. . 3 ⊢ (Rel 𝑅 → (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∀𝑥∃*𝑢 𝑢𝑅𝑥))
3	2	pm5.32ri 575	. 2 ⊢ ((∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 𝑢𝑅𝑥 ∧ Rel 𝑅))
4	1, 3	bitri 275	1 ⊢ ((∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(𝑢 = 𝑣 ∨ ([𝑢]𝑅 ∩ [𝑣]𝑅) = ∅) ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 𝑢𝑅𝑥 ∧ Rel 𝑅))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∨ wo 847  ∀wal 1539   = wceq 1541  ∃*wmo 2533  ∀wral 3047  ∃*wrmo 3345   ∩ cin 3896  ∅c0 4280   class class class wbr 5089  dom cdm 5614  Rel wrel 5619  [cec 8620

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-11 2160  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-mo 2535  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rmo 3346  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-br 5090  df-opab 5152  df-xp 5620  df-rel 5621  df-cnv 5622  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ec 8624

This theorem is referenced by:  cosscnvssid5  38590