Theorem inxpssidinxp 38298

Description: Two ways to say that intersections with Cartesian products are in a subclass relation, special case of inxpss2 38297. (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 38297	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ ( I ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 I 𝑦))
2		ideqg 5865	. . . . 5 ⊢ (𝑦 ∈ V → (𝑥 I 𝑦 ↔ 𝑥 = 𝑦))
3	2	elv 3483	. . . 4 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
4	3	imbi2i 336	. . 3 ⊢ ((𝑥𝑅𝑦 → 𝑥 I 𝑦) ↔ (𝑥𝑅𝑦 → 𝑥 = 𝑦))
5	4	2ralbii 3126	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 I 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 = 𝑦))
6	1, 5	bitri 275	1 ⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ ( I ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 = 𝑦))

Syntax hints:   → wi 4   ↔ wb 206  ∀wral 3059  Vcvv 3478   ∩ cin 3962   ⊆ wss 3963   class class class wbr 5148   I cid 5582   × cxp 5687

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-id 5583  df-xp 5695  df-rel 5696

This theorem is referenced by:  dfcnvrefrels3  38511  dfcnvrefrel3  38513