Theorem dffix2 36759

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 3454	. . . 4 ⊢ 𝑥 ∈ V
2	1	elfix 36757	. . 3 ⊢ (𝑥 ∈ Fix 𝐴 ↔ 𝑥𝐴𝑥)
3	1	elrn 5874	. . . 4 ⊢ (𝑥 ∈ ran (𝐴 ∩ I ) ↔ ∃𝑦 𝑦(𝐴 ∩ I )𝑥)
4		brin 5156	. . . . . 6 ⊢ (𝑦(𝐴 ∩ I )𝑥 ↔ (𝑦𝐴𝑥 ∧ 𝑦 I 𝑥))
5		ancom 466	. . . . . 6 ⊢ ((𝑦𝐴𝑥 ∧ 𝑦 I 𝑥) ↔ (𝑦 I 𝑥 ∧ 𝑦𝐴𝑥))
6	1	ideq 5829	. . . . . . 7 ⊢ (𝑦 I 𝑥 ↔ 𝑦 = 𝑥)
7	6	anbi1i 636	. . . . . 6 ⊢ ((𝑦 I 𝑥 ∧ 𝑦𝐴𝑥) ↔ (𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
8	4, 5, 7	3bitri 300	. . . . 5 ⊢ (𝑦(𝐴 ∩ I )𝑥 ↔ (𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
9	8	exbii 1880	. . . 4 ⊢ (∃𝑦 𝑦(𝐴 ∩ I )𝑥 ↔ ∃𝑦(𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
10		breq1 5105	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦𝐴𝑥 ↔ 𝑥𝐴𝑥))
11	10	equsexvw 2037	. . . 4 ⊢ (∃𝑦(𝑦 = 𝑥 ∧ 𝑦𝐴𝑥) ↔ 𝑥𝐴𝑥)
12	3, 9, 11	3bitri 300	. . 3 ⊢ (𝑥 ∈ ran (𝐴 ∩ I ) ↔ 𝑥𝐴𝑥)
13	2, 12	bitr4i 281	. 2 ⊢ (𝑥 ∈ Fix 𝐴 ↔ 𝑥 ∈ ran (𝐴 ∩ I ))
14	13	eqriv 2757	1 ⊢ Fix 𝐴 = ran (𝐴 ∩ I )

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ∩ cin 4089   class class class wbr 5102   I cid 5544  ran crn 5651   Fix cfix 36689

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-fix 36713

This theorem is used by:  fixssrn  36761