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 ⊢ A ∈ S ∧ B ∈ S → dom ⁡ ⟨“ AB ”⟩ = 0 1

Proof

Step Hyp Ref Expression
1 s2prop ⊢ A ∈ S ∧ B ∈ S → ⟨“ AB ”⟩ = 0 A 1 B
2 1 dmeqd ⊢ A ∈ S ∧ B ∈ S → dom ⁡ ⟨“ AB ”⟩ = dom ⁡ 0 A 1 B
3 dmpropg ⊢ A ∈ S ∧ B ∈ S → dom ⁡ 0 A 1 B = 0 1
4 2 3 eqtrd ⊢ A ∈ S ∧ B ∈ S → dom ⁡ ⟨“ AB ”⟩ = 0 1