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

Theorem resiexg 5083
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 5066 . . 3 Rel ( I ↾ 𝐴)
2 simpr 110 . . . . 5 ((𝑥 = 𝑦𝑥𝐴) → 𝑥𝐴)
3 eleq1 2295 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
43biimpa 296 . . . . 5 ((𝑥 = 𝑦𝑥𝐴) → 𝑦𝐴)
52, 4jca 306 . . . 4 ((𝑥 = 𝑦𝑥𝐴) → (𝑥𝐴𝑦𝐴))
6 vex 2816 . . . . . 6 𝑦 ∈ V
76opelres 5043 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥𝐴))
8 df-br 4110 . . . . . . 7 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
96ideq 4907 . . . . . . 7 (𝑥 I 𝑦𝑥 = 𝑦)
108, 9bitr3i 186 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑥 = 𝑦)
1110anbi1i 458 . . . . 5 ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥𝐴) ↔ (𝑥 = 𝑦𝑥𝐴))
127, 11bitri 184 . . . 4 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝐴) ↔ (𝑥 = 𝑦𝑥𝐴))
13 opelxp 4779 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐴) ↔ (𝑥𝐴𝑦𝐴))
145, 12, 133imtr4i 201 . . 3 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝐴) → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐴))
151, 14relssi 4841 . 2 ( I ↾ 𝐴) ⊆ (𝐴 × 𝐴)
16 xpexg 4864 . . 3 ((𝐴𝑉𝐴𝑉) → (𝐴 × 𝐴) ∈ V)
1716anidms 397 . 2 (𝐴𝑉 → (𝐴 × 𝐴) ∈ V)
18 ssexg 4249 . 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 2203  Vcvv 2813  wss 3211  cop 3692   class class class wbr 4109   I cid 4409   × cxp 4747  cres 4751
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-res 4761
This theorem is referenced by:  ordiso  7327  omct  7408  ctssexmid  7441  ssomct  13196  ndxarg  13235  ausgrusgrben  16163  subctctexmid  16774
  Copyright terms: Public domain W3C validator