Theorem idinxpssinxp2 39006

Description: Identity intersection with a square Cartesian product in subclass relation with an intersection with the same Cartesian product. (Contributed by Peter Mazsa, 4-Mar-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
idinxpssinxp2	⊢ (( I ∩ (𝐴 × 𝐴)) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

Proof of Theorem idinxpssinxp2

Step	Hyp	Ref	Expression
1		idinxpresid 6052	. . . 4 ⊢ ( I ∩ (𝐴 × 𝐴)) = ( I ↾ 𝐴)
2	1	sseq1i 3966	. . 3 ⊢ (( I ∩ (𝐴 × 𝐴)) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ( I ↾ 𝐴) ⊆ (𝑅 ∩ (𝐴 × 𝐴)))
3		idrefALT 6115	. . 3 ⊢ (( I ↾ 𝐴) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ∀𝑥 ∈ 𝐴 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥)
4		brinxp2 5741	. . . . 5 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑥𝑅𝑥))
5		pm4.24 574	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
6	5	anbi1i 636	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑥) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑥𝑅𝑥))
7	4, 6	bitr4i 281	. . . 4 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑥))
8	7	ralbii 3113	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥 ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑥))
9	2, 3, 8	3bitri 300	. 2 ⊢ (( I ∩ (𝐴 × 𝐴)) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑥))
10		ralanid 3115	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)
11	9, 10	bitri 278	1 ⊢ (( I ∩ (𝐴 × 𝐴)) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∈ wcel 2146  ∀wral 3081   ∩ cin 3905   ⊆ wss 3906   class class class wbr 5111   I cid 5557   × cxp 5661   ↾ cres 5665

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 2148  ax-9 2156  ax-11 2195  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-res 5675

This theorem is used by:  idinxpssinxp3  39007  idinxpssinxp4  39008