Theorem idresssidinxp 39065

Description: Condition for the identity restriction to be a subclass of identity intersection with a Cartesian product. (Contributed by Peter Mazsa, 19-Jul-2018.)

Assertion

Ref	Expression
idresssidinxp	⊢ (𝐴 ⊆ 𝐵 → ( I ↾ 𝐴) ⊆ ( I ∩ (𝐴 × 𝐵)))

Proof of Theorem idresssidinxp

Step	Hyp	Ref	Expression
1		resss 5994	. . 3 ⊢ ( I ↾ 𝐴) ⊆ I
2	1	a1i 11	. 2 ⊢ (𝐴 ⊆ 𝐵 → ( I ↾ 𝐴) ⊆ I )
3		idssxp 6045	. . 3 ⊢ ( I ↾ 𝐴) ⊆ (𝐴 × 𝐴)
4		xpss2 5675	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 × 𝐴) ⊆ (𝐴 × 𝐵))
5	3, 4	sstrid 3942	. 2 ⊢ (𝐴 ⊆ 𝐵 → ( I ↾ 𝐴) ⊆ (𝐴 × 𝐵))
6	2, 5	ssind 4186	1 ⊢ (𝐴 ⊆ 𝐵 → ( I ↾ 𝐴) ⊆ ( I ∩ (𝐴 × 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∩ cin 3898   ⊆ wss 3899   I cid 5549   × cxp 5653   ↾ cres 5657

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 2732  ax-sep 5251  ax-pr 5398

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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-res 5667

This theorem is used by:  idreseqidinxp  39066