Theorem cnvepresdmqss 36764

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 36469	. . 3 ⊢ (𝐴 ∈ 𝑉 → (◡ E ↾ 𝐴) ∈ V)
2		brdmqss 36759	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (◡ E ↾ 𝐴) ∈ V) → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴))
3	1, 2	mpdan 684	. 2 ⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴))
4		n0el3 36763	. 2 ⊢ (¬ ∅ ∈ 𝐴 ↔ (dom (◡ E ↾ 𝐴) / (◡ E ↾ 𝐴)) = 𝐴)
5	3, 4	bitr4di 289	1 ⊢ (𝐴 ∈ 𝑉 → ((◡ E ↾ 𝐴) DomainQss 𝐴 ↔ ¬ ∅ ∈ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   = wceq 1539   ∈ wcel 2106  Vcvv 3432  ∅c0 4256   class class class wbr 5074   E cep 5494  ^◡ccnv 5588  dom cdm 5589   ↾ cres 5591   / cqs 8497   DomainQss cdmqss 36356

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-eprel 5495  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ec 8500  df-qs 8504  df-dmqss 36751

This theorem is referenced by: (None)