Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  refimssco Structured version   Visualization version   GIF version

Theorem refimssco 39974
Description: Reflexive relations are subsets of their self-composition. (Contributed by RP, 4-Aug-2020.)
Assertion
Ref Expression
refimssco (( I ↾ (dom 𝐴 ∪ ran 𝐴)) ⊆ 𝐴𝐴(𝐴𝐴))

Proof of Theorem refimssco
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 5072 . . . . . . . . . . 11 (𝑧 = 𝑥 → (𝑥𝐴𝑧𝑥𝐴𝑥))
2 breq1 5071 . . . . . . . . . . 11 (𝑧 = 𝑥 → (𝑧𝐴𝑦𝑥𝐴𝑦))
31, 2anbi12d 632 . . . . . . . . . 10 (𝑧 = 𝑥 → ((𝑥𝐴𝑧𝑧𝐴𝑦) ↔ (𝑥𝐴𝑥𝑥𝐴𝑦)))
43biimprd 250 . . . . . . . . 9 (𝑧 = 𝑥 → ((𝑥𝐴𝑥𝑥𝐴𝑦) → (𝑥𝐴𝑧𝑧𝐴𝑦)))
54spimevw 2001 . . . . . . . 8 ((𝑥𝐴𝑥𝑥𝐴𝑦) → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦))
65ex 415 . . . . . . 7 (𝑥𝐴𝑥 → (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
76adantr 483 . . . . . 6 ((𝑥𝐴𝑥𝑦𝐴𝑦) → (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
87com12 32 . . . . 5 (𝑥𝐴𝑦 → ((𝑥𝐴𝑥𝑦𝐴𝑦) → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
98a2i 14 . . . 4 ((𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)) → (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
10 19.37v 1998 . . . 4 (∃𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)) ↔ (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
119, 10sylibr 236 . . 3 ((𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)) → ∃𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)))
12112alimi 1813 . 2 (∀𝑥𝑦(𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)) → ∀𝑥𝑦𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)))
13 reflexg 39972 . 2 (( I ↾ (dom 𝐴 ∪ ran 𝐴)) ⊆ 𝐴 ↔ ∀𝑥𝑦(𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)))
14 cnvssco 39973 . 2 (𝐴(𝐴𝐴) ↔ ∀𝑥𝑦𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)))
1512, 13, 143imtr4i 294 1 (( I ↾ (dom 𝐴 ∪ ran 𝐴)) ⊆ 𝐴𝐴(𝐴𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wal 1535  wex 1780  cun 3936  wss 3938   class class class wbr 5068   I cid 5461  ccnv 5556  dom cdm 5557  ran crn 5558  cres 5559  ccom 5561
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator