Metamath Proof Explorer


Theorem s3tpop

Description: A length 3 word is an unordered triple of ordered pairs. (Contributed by AV, 23-Jan-2021)

Ref Expression
Assertion s3tpop ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ ABC ”⟩ = 0 A 1 B 2 C

Proof

Step Hyp Ref Expression
1 df-s3 ⊢ ⟨“ ABC ”⟩ = ⟨“ AB ”⟩ ++ ⟨“ C ”⟩
2 s2cl ⊢ A ∈ S ∧ B ∈ S → ⟨“ AB ”⟩ ∈ Word S
3 cats1un ⊢ ⟨“ AB ”⟩ ∈ Word S ∧ C ∈ S → ⟨“ AB ”⟩ ++ ⟨“ C ”⟩ = ⟨“ AB ”⟩ ∪ ⟨“ AB ”⟩ C
4 2 3 stoic3 ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ AB ”⟩ ++ ⟨“ C ”⟩ = ⟨“ AB ”⟩ ∪ ⟨“ AB ”⟩ C
5 s2prop ⊢ A ∈ S ∧ B ∈ S → ⟨“ AB ”⟩ = 0 A 1 B
6 5 3adant3 ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ AB ”⟩ = 0 A 1 B
7 s2len ⊢ ⟨“ AB ”⟩ = 2
8 7 opeq1i ⊢ ⟨“ AB ”⟩ C = 2 C
9 8 sneqi ⊢ ⟨“ AB ”⟩ C = 2 C
10 9 a1i ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ AB ”⟩ C = 2 C
11 6 10 uneq12d ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ AB ”⟩ ∪ ⟨“ AB ”⟩ C = 0 A 1 B ∪ 2 C
12 df-tp ⊢ 0 A 1 B 2 C = 0 A 1 B ∪ 2 C
13 12 eqcomi ⊢ 0 A 1 B ∪ 2 C = 0 A 1 B 2 C
14 13 a1i ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → 0 A 1 B ∪ 2 C = 0 A 1 B 2 C
15 4 11 14 3eqtrd ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ AB ”⟩ ++ ⟨“ C ”⟩ = 0 A 1 B 2 C
16 1 15 eqtrid ⊢ A ∈ S ∧ B ∈ S ∧ C ∈ S → ⟨“ ABC ”⟩ = 0 A 1 B 2 C