Theorem idinxpssinxp 39005

Description: Two ways to say that intersections with Cartesian products are in a subclass relation, special case of inxpss2 39003. (Contributed by Peter Mazsa, 6-Mar-2019.)

Assertion

Ref	Expression
idinxpssinxp	⊢ (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 → 𝑥𝑅𝑦))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦

Proof of Theorem idinxpssinxp

Step	Hyp	Ref	Expression
1		inxpss2 39003	. 2 ⊢ (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 I 𝑦 → 𝑥𝑅𝑦))
2		ideqg 5839	. . . . 5 ⊢ (𝑦 ∈ V → (𝑥 I 𝑦 ↔ 𝑥 = 𝑦))
3	2	elv 3462	. . . 4 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
4	3	imbi1i 352	. . 3 ⊢ ((𝑥 I 𝑦 → 𝑥𝑅𝑦) ↔ (𝑥 = 𝑦 → 𝑥𝑅𝑦))
5	4	2ralbii 3142	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 I 𝑦 → 𝑥𝑅𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 → 𝑥𝑅𝑦))
6	1, 5	bitri 278	1 ⊢ (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 → 𝑥𝑅𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wral 3081  Vcvv 3457   ∩ cin 3905   ⊆ wss 3906   class class class wbr 5111   I cid 5557   × cxp 5661

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-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

This theorem is used by:  idinxpssinxp4  39008