ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  resiexg GIF version

Theorem resiexg 5050
Description: The existence of a restricted identity function, proved without using the Axiom of Replacement. (Contributed by NM, 13-Jan-2007.)
Assertion
Ref Expression
resiexg (𝐴𝑉 → ( I ↾ 𝐴) ∈ V)

Proof of Theorem resiexg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 5033 . . 3 Rel ( I ↾ 𝐴)
2 simpr 110 . . . . 5 ((𝑥 = 𝑦𝑥𝐴) → 𝑥𝐴)
3 eleq1 2292 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
43biimpa 296 . . . . 5 ((𝑥 = 𝑦𝑥𝐴) → 𝑦𝐴)
52, 4jca 306 . . . 4 ((𝑥 = 𝑦𝑥𝐴) → (𝑥𝐴𝑦𝐴))
6 vex 2802 . . . . . 6 𝑦 ∈ V
76opelres 5010 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥𝐴))
8 df-br 4084 . . . . . . 7 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
96ideq 4874 . . . . . . 7 (𝑥 I 𝑦𝑥 = 𝑦)
108, 9bitr3i 186 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑥 = 𝑦)
1110anbi1i 458 . . . . 5 ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥𝐴) ↔ (𝑥 = 𝑦𝑥𝐴))
127, 11bitri 184 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝐴) ↔ (𝑥 = 𝑦𝑥𝐴))
13 opelxp 4749 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐴) ↔ (𝑥𝐴𝑦𝐴))
145, 12, 133imtr4i 201 . . 3 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝐴) → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐴))
151, 14relssi 4810 . 2 ( I ↾ 𝐴) ⊆ (𝐴 × 𝐴)
16 xpexg 4833 . . 3 ((𝐴𝑉𝐴𝑉) → (𝐴 × 𝐴) ∈ V)
1716anidms 397 . 2 (𝐴𝑉 → (𝐴 × 𝐴) ∈ V)
18 ssexg 4223 . 2 ((( I ↾ 𝐴) ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → ( I ↾ 𝐴) ∈ V)
1915, 17, 18sylancr 414 1 (𝐴𝑉 → ( I ↾ 𝐴) ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wcel 2200  Vcvv 2799  wss 3197  cop 3669   class class class wbr 4083   I cid 4379   × cxp 4717  cres 4721
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-res 4731
This theorem is referenced by:  ordiso  7203  omct  7284  ctssexmid  7317  ssomct  13016  ndxarg  13055  ausgrusgrben  15966  subctctexmid  16366
  Copyright terms: Public domain W3C validator