Theorem cnvepresdmqs 36692

Description: The domain quotient predicate for the restricted converse epsilon relation is equivalent to the negated elementhood of the empty set in the restriction. (Contributed by Peter Mazsa, 14-Aug-2021.)

Assertion

Ref	Expression
cnvepresdmqs	⊢ ((◡ E ↾ 𝐴) DomainQs 𝐴 ↔ ¬ ∅ ∈ 𝐴)

Proof of Theorem cnvepresdmqs

Step	Hyp	Ref	Expression
1		df-dmqs 36679	. 2 ⊢ ((◡ E ↾ 𝐴) DomainQs 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴)
2		n0el3 36690	. 2 ⊢ (¬ ∅ ∈ 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴)
3	1, 2	bitr4i 277	1 ⊢ ((◡ E ↾ 𝐴) DomainQs 𝐴 ↔ ¬ ∅ ∈ 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 205   = wceq 1539   ∈ wcel 2108  ∅c0 4253   E cep 5485  ^◡ccnv 5579  dom cdm 5580   ↾ cres 5582   / cqs 8455   DomainQs wdmqs 36284

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-eprel 5486  df-xp 5586  df-rel 5587  df-cnv 5588  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ec 8458  df-qs 8462  df-dmqs 36679

This theorem is referenced by: (None)