Theorem cnvepresdmqss 39332

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 38931	. . 3 ⊢ (𝐴 ∈ 𝑉 → (◡ E ↾ 𝐴) ∈ V)
2		brdmqss 39325	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (◡ E ↾ 𝐴) ∈ V) → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴))
3	1, 2	mpdan 699	. 2 ⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴))
4		n0el3 39331	. 2 ⊢ (¬ ∅ ∈ 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴)
5	3, 4	bitr4di 292	1 ⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ ¬ ∅ ∈ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1568   ∈ wcel 2141  Vcvv 3453  ∅c0 4285   class class class wbr 5108   E cep 5560  ^◡ccnv 5660  dom cdm 5661   ↾ cres 5663   / cqs 8692   DomainQss cdmqss 38801

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-eprel 5561  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ec 8695  df-qs 8699  df-dmqss 39317

This theorem is referenced by: (None)