Metamath Proof Explorer


Theorem rabsstp

Description: Conditions for a restricted class abstraction to be a subset of an unordered triplet. (Contributed by Thierry Arnoux, 6-Jul-2025)

Ref Expression
Assertion rabsstp ( { 𝑥𝑉𝜑 } ⊆ { 𝑋 , 𝑌 , 𝑍 } ↔ ∀ 𝑥𝑉 ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) )

Proof

Step Hyp Ref Expression
1 df-rab { 𝑥𝑉𝜑 } = { 𝑥 ∣ ( 𝑥𝑉𝜑 ) }
2 dftp2 { 𝑋 , 𝑌 , 𝑍 } = { 𝑥 ∣ ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) }
3 1 2 sseq12i ( { 𝑥𝑉𝜑 } ⊆ { 𝑋 , 𝑌 , 𝑍 } ↔ { 𝑥 ∣ ( 𝑥𝑉𝜑 ) } ⊆ { 𝑥 ∣ ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) } )
4 ss2ab ( { 𝑥 ∣ ( 𝑥𝑉𝜑 ) } ⊆ { 𝑥 ∣ ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) } ↔ ∀ 𝑥 ( ( 𝑥𝑉𝜑 ) → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) )
5 impexp ( ( ( 𝑥𝑉𝜑 ) → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ↔ ( 𝑥𝑉 → ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ) )
6 5 albii ( ∀ 𝑥 ( ( 𝑥𝑉𝜑 ) → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ↔ ∀ 𝑥 ( 𝑥𝑉 → ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ) )
7 df-ral ( ∀ 𝑥𝑉 ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ↔ ∀ 𝑥 ( 𝑥𝑉 → ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ) )
8 6 7 bitr4i ( ∀ 𝑥 ( ( 𝑥𝑉𝜑 ) → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) ↔ ∀ 𝑥𝑉 ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) )
9 3 4 8 3bitri ( { 𝑥𝑉𝜑 } ⊆ { 𝑋 , 𝑌 , 𝑍 } ↔ ∀ 𝑥𝑉 ( 𝜑 → ( 𝑥 = 𝑋𝑥 = 𝑌𝑥 = 𝑍 ) ) )