Metamath Proof Explorer


Theorem s2dmALT

Description: Alternate version of s2dm , having a shorter proof, but requiring that A and B are sets. (Contributed by AV, 9-Jan-2020) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion s2dmALT ASBSdom⟨“AB”⟩=01

Proof

Step Hyp Ref Expression
1 s2prop ASBS⟨“AB”⟩=0A1B
2 1 dmeqd ASBSdom⟨“AB”⟩=dom0A1B
3 dmpropg ASBSdom0A1B=01
4 2 3 eqtrd ASBSdom⟨“AB”⟩=01