Theorem dffix2 36416

Description: The fixpoints of a class in terms of its range. (Contributed by Scott Fenton, 16-Apr-2012.)

Assertion

Ref	Expression
dffix2	⊢ Fix 𝐴 = ran (𝐴 ∩ I )

Proof of Theorem dffix2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3462	. . . 4 ⊢ 𝑥 ∈ V
2	1	elfix 36414	. . 3 ⊢ (𝑥 ∈ Fix 𝐴 ↔ 𝑥𝐴𝑥)
3	1	elrn 5888	. . . 4 ⊢ (𝑥 ∈ ran (𝐴 ∩ I ) ↔ ∃𝑦 𝑦(𝐴 ∩ I )𝑥)
4		brin 5168	. . . . . 6 ⊢ (𝑦(𝐴 ∩ I )𝑥 ↔ (𝑦𝐴𝑥 ∧ 𝑦 I 𝑥))
5		ancom 466	. . . . . 6 ⊢ ((𝑦𝐴𝑥 ∧ 𝑦 I 𝑥) ↔ (𝑦 I 𝑥 ∧ 𝑦𝐴𝑥))
6	1	ideq 5843	. . . . . . 7 ⊢ (𝑦 I 𝑥 ↔ 𝑦 = 𝑥)
7	6	anbi1i 636	. . . . . 6 ⊢ ((𝑦 I 𝑥 ∧ 𝑦𝐴𝑥) ↔ (𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
8	4, 5, 7	3bitri 300	. . . . 5 ⊢ (𝑦(𝐴 ∩ I )𝑥 ↔ (𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
9	8	exbii 1881	. . . 4 ⊢ (∃𝑦 𝑦(𝐴 ∩ I )𝑥 ↔ ∃𝑦(𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
10		breq1 5117	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦𝐴𝑥 ↔ 𝑥𝐴𝑥))
11	10	equsexvw 2038	. . . 4 ⊢ (∃𝑦(𝑦 = 𝑥 ∧ 𝑦𝐴𝑥) ↔ 𝑥𝐴𝑥)
12	3, 9, 11	3bitri 300	. . 3 ⊢ (𝑥 ∈ ran (𝐴 ∩ I ) ↔ 𝑥𝐴𝑥)
13	2, 12	bitr4i 281	. 2 ⊢ (𝑥 ∈ Fix 𝐴 ↔ 𝑥 ∈ ran (𝐴 ∩ I ))
14	13	eqriv 2763	1 ⊢ Fix 𝐴 = ran (𝐴 ∩ I )

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2146   ∩ cin 3907   class class class wbr 5114   I cid 5560  ran crn 5667   Fix cfix 36346

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-dm 5676  df-rn 5677  df-fix 36370

This theorem is used by:  fixssrn  36418