Theorem inxpssidinxp 39070

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

Assertion

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

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

Proof of Theorem inxpssidinxp

Step	Hyp	Ref	Expression
1		inxpss2 39069	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ ( I ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 I 𝑦))
2		ideqg 5831	. . . . 5 ⊢ (𝑦 ∈ V → (𝑥 I 𝑦 ↔ 𝑥 = 𝑦))
3	2	elv 3455	. . . 4 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
4	3	imbi2i 339	. . 3 ⊢ ((𝑥𝑅𝑦 → 𝑥 I 𝑦) ↔ (𝑥𝑅𝑦 → 𝑥 = 𝑦))
5	4	2ralbii 3137	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 I 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 = 𝑦))
6	1, 5	bitri 278	1 ⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ ( I ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 = 𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wral 3076  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899   class class class wbr 5103   I cid 5549   × cxp 5653

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

This theorem is used by:  dfcnvrefrels3  39357  dfcnvrefrel3  39359