Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iss2 Structured version   Visualization version   GIF version

Theorem iss2 39276
Description: A subclass of the identity relation is the intersection of identity relation with Cartesian product of the domain and range of the class. (Contributed by Peter Mazsa, 22-Jul-2019.)
Assertion
Ref Expression
iss2 (𝐴 ⊆ I ↔ 𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)))

Proof of Theorem iss2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3925 . . . . . . . . 9 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ I ))
2 vex 3455 . . . . . . . . . 10 𝑥 ∈ V
3 vex 3455 . . . . . . . . . 10 𝑦 ∈ V
42, 3opeldm 5889 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → 𝑥 ∈ dom 𝐴)
51, 4jca2 523 . . . . . . . 8 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴)))
62, 3opelrn 5925 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → 𝑦 ∈ ran 𝐴)
71, 6jca2 523 . . . . . . . 8 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑦 ∈ ran 𝐴)))
85, 7jcad 522 . . . . . . 7 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴) ∧ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑦 ∈ ran 𝐴))))
9 anandi 689 . . . . . . 7 ((⟨𝑥, 𝑦⟩ ∈ I ∧ (𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴)) ↔ ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 ∈ dom 𝐴) ∧ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑦 ∈ ran 𝐴)))
108, 9imbitrrdi 255 . . . . . 6 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (⟨𝑥, 𝑦⟩ ∈ I ∧ (𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴))))
11 df-br 5104 . . . . . . . . 9 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
123ideq 5830 . . . . . . . . 9 (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
1311, 12bitr3i 280 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑥 = 𝑦)
142eldm2 5883 . . . . . . . . . . . . 13 (𝑥 ∈ dom 𝐴 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
15 opeq2 4834 . . . . . . . . . . . . . . . . . 18 (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
1615eleq1d 2846 . . . . . . . . . . . . . . . . 17 (𝑥 = 𝑦 → (⟨𝑥, 𝑥⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴))
1716biimprcd 253 . . . . . . . . . . . . . . . 16 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
1813, 17biimtrid 245 . . . . . . . . . . . . . . 15 (⟨𝑥, 𝑦⟩ ∈ 𝐴 → (⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
191, 18sylcom 31 . . . . . . . . . . . . . 14 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
2019exlimdv 1966 . . . . . . . . . . . . 13 (𝐴 ⊆ I → (∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
2114, 20biimtrid 245 . . . . . . . . . . . 12 (𝐴 ⊆ I → (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴))
2216imbi2d 343 . . . . . . . . . . . 12 (𝑥 = 𝑦 → ((𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑥⟩ ∈ 𝐴) ↔ (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
2321, 22syl5ibcom 248 . . . . . . . . . . 11 (𝐴 ⊆ I → (𝑥 = 𝑦 → (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
2423imp 412 . . . . . . . . . 10 ((𝐴 ⊆ I ∧ 𝑥 = 𝑦) → (𝑥 ∈ dom 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐴))
2524adantrd 497 . . . . . . . . 9 ((𝐴 ⊆ I ∧ 𝑥 = 𝑦) → ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴) → ⟨𝑥, 𝑦⟩ ∈ 𝐴))
2625ex 418 . . . . . . . 8 (𝐴 ⊆ I → (𝑥 = 𝑦 → ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴) → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
2713, 26biimtrid 245 . . . . . . 7 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ I → ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴) → ⟨𝑥, 𝑦⟩ ∈ 𝐴)))
2827impd 416 . . . . . 6 (𝐴 ⊆ I → ((⟨𝑥, 𝑦⟩ ∈ I ∧ (𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴)) → ⟨𝑥, 𝑦⟩ ∈ 𝐴))
2910, 28impbid 215 . . . . 5 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ (𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴))))
30 opelinxp 5731 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ ( I ∩ (dom 𝐴 × ran 𝐴)) ↔ ((𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴) ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
3130biancomi 468 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ ( I ∩ (dom 𝐴 × ran 𝐴)) ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ (𝑥 ∈ dom 𝐴 ∧ 𝑦 ∈ ran 𝐴)))
3229, 31bitr4di 292 . . . 4 (𝐴 ⊆ I → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ∩ (dom 𝐴 × ran 𝐴))))
3332alrimivv 1961 . . 3 (𝐴 ⊆ I → ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ∩ (dom 𝐴 × ran 𝐴))))
34 reli 5804 . . . . 5 Rel I
35 relss 5758 . . . . 5 (𝐴 ⊆ I → (Rel I → Rel 𝐴))
3634, 35mpi 21 . . . 4 (𝐴 ⊆ I → Rel 𝐴)
37 relinxp 5792 . . . 4 Rel ( I ∩ (dom 𝐴 × ran 𝐴))
38 eqrel 5760 . . . 4 ((Rel 𝐴 ∧ Rel ( I ∩ (dom 𝐴 × ran 𝐴))) → (𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ∩ (dom 𝐴 × ran 𝐴)))))
3936, 37, 38sylancl 598 . . 3 (𝐴 ⊆ I → (𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ∩ (dom 𝐴 × ran 𝐴)))))
4033, 39mpbird 260 . 2 (𝐴 ⊆ I → 𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)))
41 inss1 4182 . . 3 ( I ∩ (dom 𝐴 × ran 𝐴)) ⊆ I
42 sseq1 3956 . . 3 (𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)) → (𝐴 ⊆ I ↔ ( I ∩ (dom 𝐴 × ran 𝐴)) ⊆ I ))
4341, 42mpbiri 261 . 2 (𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)) → 𝐴 ⊆ I )
4440, 43impbii 212 1 (𝐴 ⊆ I ↔ 𝐴 = ( I ∩ (dom 𝐴 × ran 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ∩ cin 3898   ⊆ wss 3899  ⟨cop 4590   class class class wbr 5103   I cid 5545   × cxp 5649  dom cdm 5651  ran crn 5652  Rel wrel 5656
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 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662
This theorem is used by:  cossssid  39489
  Copyright terms: Public domain W3C validator