Metamath Proof Explorer


Theorem br1steqg

Description: Uniqueness condition for the binary relation 1st . (Contributed by Scott Fenton, 2-Jul-2020) Revised to remove sethood hypothesis on C . (Revised by Peter Mazsa, 17-Jan-2022)

Ref Expression
Assertion br1steqg ⊢ A ∈ V ∧ B ∈ W → A B 1 st C ↔ C = A

Proof

Step Hyp Ref Expression
1 op1stg ⊢ A ∈ V ∧ B ∈ W → 1 st ⁡ A B = A
2 1 eqeq1d ⊢ A ∈ V ∧ B ∈ W → 1 st ⁡ A B = C ↔ A = C
3 fo1st ⊢ 1 st : V ⟶ onto V
4 fofn ⊢ 1 st : V ⟶ onto V → 1 st Fn V
5 3 4 ax-mp ⊢ 1 st Fn V
6 opex ⊢ A B ∈ V
7 fnbrfvb ⊢ 1 st Fn V ∧ A B ∈ V → 1 st ⁡ A B = C ↔ A B 1 st C
8 5 6 7 mp2an ⊢ 1 st ⁡ A B = C ↔ A B 1 st C
9 eqcom ⊢ A = C ↔ C = A
10 2 8 9 3bitr3g ⊢ A ∈ V ∧ B ∈ W → A B 1 st C ↔ C = A