Theorem inecmo3 38908

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 38895	. 2 ⊢ ((∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(𝑢 = 𝑣 ∨ ([𝑢]𝑅 ∩ [𝑣]𝑅) = ∅) ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ∧ Rel 𝑅))
2		alrmomodm 38898	. . 3 ⊢ (Rel 𝑅 → (∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ↔ ∀𝑥∃*𝑢 𝑢𝑅𝑥))
3	2	pm5.32ri 585	. 2 ⊢ ((∀𝑥∃*𝑢 ∈ dom 𝑅 𝑢𝑅𝑥 ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 𝑢𝑅𝑥 ∧ Rel 𝑅))
4	1, 3	bitri 278	1 ⊢ ((∀𝑢 ∈ dom 𝑅∀𝑣 ∈ dom 𝑅(𝑢 = 𝑣 ∨ ([𝑢]𝑅 ∩ [𝑣]𝑅) = ∅) ∧ Rel 𝑅) ↔ (∀𝑥∃*𝑢 𝑢𝑅𝑥 ∧ Rel 𝑅))

Syntax hints:   ↔ wb 209   ∧ wa 400   ∨ wo 860  ∀wal 1565   = wceq 1567  ∃*wmo 2571  ∀wral 3085  ∃*wrmo 3375   ∩ cin 3912  ∅c0 4294   class class class wbr 5113  dom cdm 5662  Rel wrel 5667  [cec 8692

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-11 2198  ax-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rmo 3376  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ec 8696

This theorem is referenced by:  cosscnvssid5  39107