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

Theorem brfvrcld2 43688
Description: If two elements are connected by the reflexive closure of a relation, then they are equal or related by relation. (Contributed by RP, 21-Jul-2020.)
Hypothesis
Ref Expression
brfvrcld2.r (𝜑𝑅 ∈ V)
Assertion
Ref Expression
brfvrcld2 (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵)))

Proof of Theorem brfvrcld2
StepHypRef Expression
1 brfvrcld2.r . . 3 (𝜑𝑅 ∈ V)
21brfvrcld 43687 . 2 (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ (𝐴(𝑅𝑟0)𝐵𝐴(𝑅𝑟1)𝐵)))
3 relexp0g 14995 . . . . . 6 (𝑅 ∈ V → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
41, 3syl 17 . . . . 5 (𝜑 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
54breqd 5121 . . . 4 (𝜑 → (𝐴(𝑅𝑟0)𝐵𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵))
6 relres 5979 . . . . . . . 8 Rel ( I ↾ (dom 𝑅 ∪ ran 𝑅))
76releldmi 5915 . . . . . . 7 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
86relelrni 5916 . . . . . . 7 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
9 dmresi 6026 . . . . . . . . . 10 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
109eleq2i 2821 . . . . . . . . 9 (𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ 𝐴 ∈ (dom 𝑅 ∪ ran 𝑅))
1110biimpi 216 . . . . . . . 8 (𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) → 𝐴 ∈ (dom 𝑅 ∪ ran 𝑅))
12 rnresi 6049 . . . . . . . . . 10 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
1312eleq2i 2821 . . . . . . . . 9 (𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅))
1413biimpi 216 . . . . . . . 8 (𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) → 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅))
1511, 14anim12i 613 . . . . . . 7 ((𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) → (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)))
167, 8, 15syl2anc 584 . . . . . 6 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 → (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)))
17 resieq 5964 . . . . . 6 ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) → (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵𝐴 = 𝐵))
1816, 17biadanii 821 . . . . 5 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐴 = 𝐵))
19 df-3an 1088 . . . . 5 ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐴 = 𝐵))
2018, 19bitr4i 278 . . . 4 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵))
215, 20bitrdi 287 . . 3 (𝜑 → (𝐴(𝑅𝑟0)𝐵 ↔ (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵)))
221relexp1d 15002 . . . 4 (𝜑 → (𝑅𝑟1) = 𝑅)
2322breqd 5121 . . 3 (𝜑 → (𝐴(𝑅𝑟1)𝐵𝐴𝑅𝐵))
2421, 23orbi12d 918 . 2 (𝜑 → ((𝐴(𝑅𝑟0)𝐵𝐴(𝑅𝑟1)𝐵) ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵)))
252, 24bitrd 279 1 (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 847  w3a 1086   = wceq 1540  wcel 2109  Vcvv 3450  cun 3915   class class class wbr 5110   I cid 5535  dom cdm 5641  ran crn 5642  cres 5643  cfv 6514  (class class class)co 7390  0cc0 11075  1c1 11076  𝑟crelexp 14992  r*crcl 43668
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-er 8674  df-en 8922  df-dom 8923  df-sdom 8924  df-pnf 11217  df-mnf 11218  df-xr 11219  df-ltxr 11220  df-le 11221  df-sub 11414  df-neg 11415  df-nn 12194  df-n0 12450  df-z 12537  df-uz 12801  df-seq 13974  df-relexp 14993  df-rcl 43669
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator