Theorem dffix2 36490

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 3457	. . . 4 ⊢ 𝑥 ∈ V
2	1	elfix 36488	. . 3 ⊢ (𝑥 ∈ Fix 𝐴 ↔ 𝑥𝐴𝑥)
3	1	elrn 5881	. . . 4 ⊢ (𝑥 ∈ ran (𝐴 ∩ I ) ↔ ∃𝑦 𝑦(𝐴 ∩ I )𝑥)
4		brin 5161	. . . . . 6 ⊢ (𝑦(𝐴 ∩ I )𝑥 ↔ (𝑦𝐴𝑥 ∧ 𝑦 I 𝑥))
5		ancom 466	. . . . . 6 ⊢ ((𝑦𝐴𝑥 ∧ 𝑦 I 𝑥) ↔ (𝑦 I 𝑥 ∧ 𝑦𝐴𝑥))
6	1	ideq 5836	. . . . . . 7 ⊢ (𝑦 I 𝑥 ↔ 𝑦 = 𝑥)
7	6	anbi1i 636	. . . . . 6 ⊢ ((𝑦 I 𝑥 ∧ 𝑦𝐴𝑥) ↔ (𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
8	4, 5, 7	3bitri 300	. . . . 5 ⊢ (𝑦(𝐴 ∩ I )𝑥 ↔ (𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
9	8	exbii 1881	. . . 4 ⊢ (∃𝑦 𝑦(𝐴 ∩ I )𝑥 ↔ ∃𝑦(𝑦 = 𝑥 ∧ 𝑦𝐴𝑥))
10		breq1 5110	. . . . 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 2759	1 ⊢ Fix 𝐴 = ran (𝐴 ∩ I )

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ∩ cin 3901   class class class wbr 5107   I cid 5553  ran crn 5660   Fix cfix 36420

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 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-fix 36444

This theorem is used by:  fixssrn  36492