Theorem cnvepresdmqss 38048

Description: The domain quotient binary relation of 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
cnvepresdmqss	⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ ¬ ∅ ∈ 𝐴))

Proof of Theorem cnvepresdmqss

Step	Hyp	Ref	Expression
1		cnvepresex 37729	. . 3 ⊢ (𝐴 ∈ 𝑉 → (◡ E ↾ 𝐴) ∈ V)
2		brdmqss 38042	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (◡ E ↾ 𝐴) ∈ V) → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴))
3	1, 2	mpdan 686	. 2 ⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴))
4		n0el3 38047	. 2 ⊢ (¬ ∅ ∈ 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴)
5	3, 4	bitr4di 289	1 ⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ ¬ ∅ ∈ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   = wceq 1534   ∈ wcel 2099  Vcvv 3469  ∅c0 4318   class class class wbr 5142   E cep 5575  ^◡ccnv 5671  dom cdm 5672   ↾ cres 5674   / cqs 8715   DomainQss cdmqss 37593

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7732

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5143  df-opab 5205  df-eprel 5576  df-xp 5678  df-rel 5679  df-cnv 5680  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-ec 8718  df-qs 8722  df-dmqss 38034

This theorem is referenced by: (None)