Theorem brab1 5158

Description: Relationship between a binary relation and a class abstraction. (Contributed by Andrew Salmon, 8-Jul-2011.)

Assertion

Ref	Expression
brab1	⊢ (𝑥𝑅𝐴 ↔ 𝑥 ∈ {𝑧 ∣ 𝑧𝑅𝐴})

Distinct variable groups:   𝑧,𝐴   𝑧,𝑅

Allowed substitution hints:   𝐴(𝑥)   𝑅(𝑥)

Proof of Theorem brab1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 5111	. . . 4 ⊢ (𝑧 = 𝑦 → (𝑧𝑅𝐴 ↔ 𝑦𝑅𝐴))
2		breq1 5111	. . . 4 ⊢ (𝑦 = 𝑥 → (𝑦𝑅𝐴 ↔ 𝑥𝑅𝐴))
3	1, 2	sbcie2g 3783	. . 3 ⊢ (𝑥 ∈ V → ([𝑥 / 𝑧]𝑧𝑅𝐴 ↔ 𝑥𝑅𝐴))
4	3	elv 3459	. 2 ⊢ ([𝑥 / 𝑧]𝑧𝑅𝐴 ↔ 𝑥𝑅𝐴)
5		df-sbc 3744	. 2 ⊢ ([𝑥 / 𝑧]𝑧𝑅𝐴 ↔ 𝑥 ∈ {𝑧 ∣ 𝑧𝑅𝐴})
6	4, 5	bitr3i 280	1 ⊢ (𝑥𝑅𝐴 ↔ 𝑥 ∈ {𝑧 ∣ 𝑧𝑅𝐴})

This proof depends on syntax axioms:   ↔ wb 209   ∈ wcel 2142  {cab 2740  Vcvv 3454  [wsbc 3743   class class class wbr 5108

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109

This theorem is used by: (None)