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 44268
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 44267 . 2 (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ (𝐴(𝑅𝑟0)𝐵𝐴(𝑅𝑟1)𝐵)))
3 relexp0g 15035 . . . . . 6 (𝑅 ∈ V → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
41, 3syl 17 . . . . 5 (𝜑 → (𝑅𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
54breqd 5111 . . . 4 (𝜑 → (𝐴(𝑅𝑟0)𝐵𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵))
6 relres 5991 . . . . . . . 8 Rel ( I ↾ (dom 𝑅 ∪ ran 𝑅))
76releldmi 5924 . . . . . . 7 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
86relelrni 5925 . . . . . . 7 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)))
9 dmresi 6041 . . . . . . . . . 10 dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
109eleq2i 2854 . . . . . . . . 9 (𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ 𝐴 ∈ (dom 𝑅 ∪ ran 𝑅))
1110biimpi 218 . . . . . . . 8 (𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) → 𝐴 ∈ (dom 𝑅 ∪ ran 𝑅))
12 rnresi 6064 . . . . . . . . . 10 ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅)
1312eleq2i 2854 . . . . . . . . 9 (𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅))
1413biimpi 218 . . . . . . . 8 (𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) → 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅))
1511, 14anim12i 622 . . . . . . 7 ((𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) → (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)))
167, 8, 15syl2anc 593 . . . . . 6 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 → (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)))
17 resieq 5976 . . . . . 6 ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) → (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵𝐴 = 𝐵))
1816, 17biadanii 831 . . . . 5 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐴 = 𝐵))
19 df-3an 1100 . . . . 5 ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐴 = 𝐵))
2018, 19bitr4i 280 . . . 4 (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵))
215, 20bitrdi 289 . . 3 (𝜑 → (𝐴(𝑅𝑟0)𝐵 ↔ (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵)))
221relexp1d 15042 . . . 4 (𝜑 → (𝑅𝑟1) = 𝑅)
2322breqd 5111 . . 3 (𝜑 → (𝐴(𝑅𝑟1)𝐵𝐴𝑅𝐵))
2421, 23orbi12d 929 . 2 (𝜑 → ((𝐴(𝑅𝑟0)𝐵𝐴(𝑅𝑟1)𝐵) ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵)))
252, 24bitrd 281 1 (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wo 858  w3a 1098   = wceq 1560  wcel 2142  Vcvv 3454  cun 3902   class class class wbr 5100   I cid 5541  dom cdm 5647  ran crn 5648  cres 5649  cfv 6521  (class class class)co 7396  0cc0 11073  1c1 11074  𝑟crelexp 15032  r*crcl 44248
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-resscn 11130  ax-1cn 11131  ax-icn 11132  ax-addcl 11133  ax-addrcl 11134  ax-mulcl 11135  ax-mulrcl 11136  ax-mulcom 11137  ax-addass 11138  ax-mulass 11139  ax-distr 11140  ax-i2m1 11141  ax-1ne0 11142  ax-1rid 11143  ax-rnegex 11144  ax-rrecex 11145  ax-cnre 11146  ax-pre-lttri 11147  ax-pre-lttrn 11148  ax-pre-ltadd 11149  ax-pre-mulgt0 11150
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-er 8678  df-en 8928  df-dom 8929  df-sdom 8930  df-pnf 11218  df-mnf 11219  df-xr 11220  df-ltxr 11221  df-le 11222  df-sub 11416  df-neg 11417  df-nn 12211  df-n0 12482  df-z 12569  df-uz 12840  df-seq 14015  df-relexp 15033  df-rcl 44249
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator