Theorem inecmo3 35614

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

Syntax hints:   ↔ wb 208   ∧ wa 398   ∨ wo 843  ∀wal 1531   = wceq 1533  ∃*wmo 2616  ∀wral 3138  ∃*wrmo 3141   ∩ cin 3934  ∅c0 4290   class class class wbr 5065  dom cdm 5554  Rel wrel 5559  [cec 8286

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-br 5066  df-opab 5128  df-xp 5560  df-rel 5561  df-cnv 5562  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-ec 8290

This theorem is referenced by:  cosscnvssid5  35717