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 39965
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 5069 . . . . . . . . . . 11 (𝑧 = 𝑥 → (𝑥𝐴𝑧𝑥𝐴𝑥))
2 breq1 5068 . . . . . . . . . . 11 (𝑧 = 𝑥 → (𝑧𝐴𝑦𝑥𝐴𝑦))
31, 2anbi12d 632 . . . . . . . . . 10 (𝑧 = 𝑥 → ((𝑥𝐴𝑧𝑧𝐴𝑦) ↔ (𝑥𝐴𝑥𝑥𝐴𝑦)))
43biimprd 250 . . . . . . . . 9 (𝑧 = 𝑥 → ((𝑥𝐴𝑥𝑥𝐴𝑦) → (𝑥𝐴𝑧𝑧𝐴𝑦)))
54spimevw 1997 . . . . . . . 8 ((𝑥𝐴𝑥𝑥𝐴𝑦) → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦))
65ex 415 . . . . . . 7 (𝑥𝐴𝑥 → (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
76adantr 483 . . . . . 6 ((𝑥𝐴𝑥𝑦𝐴𝑦) → (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
87com12 32 . . . . 5 (𝑥𝐴𝑦 → ((𝑥𝐴𝑥𝑦𝐴𝑦) → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
98a2i 14 . . . 4 ((𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)) → (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
10 19.37v 1994 . . . 4 (∃𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)) ↔ (𝑥𝐴𝑦 → ∃𝑧(𝑥𝐴𝑧𝑧𝐴𝑦)))
119, 10sylibr 236 . . 3 ((𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)) → ∃𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)))
12112alimi 1809 . 2 (∀𝑥𝑦(𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)) → ∀𝑥𝑦𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)))
13 reflexg 39963 . 2 (( I ↾ (dom 𝐴 ∪ ran 𝐴)) ⊆ 𝐴 ↔ ∀𝑥𝑦(𝑥𝐴𝑦 → (𝑥𝐴𝑥𝑦𝐴𝑦)))
14 cnvssco 39964 . 2 (𝐴(𝐴𝐴) ↔ ∀𝑥𝑦𝑧(𝑥𝐴𝑦 → (𝑥𝐴𝑧𝑧𝐴𝑦)))
1512, 13, 143imtr4i 294 1 (( I ↾ (dom 𝐴 ∪ ran 𝐴)) ⊆ 𝐴𝐴(𝐴𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wal 1531  wex 1776  cun 3933  wss 3935   class class class wbr 5065   I cid 5458  ccnv 5553  dom cdm 5554  ran crn 5555  cres 5556  ccom 5558
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 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-br 5066  df-opab 5128  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator