Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > brfvrcld2 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
brfvrcld2.r | ⊢ (𝜑 → 𝑅 ∈ V) |
Ref | Expression |
---|---|
brfvrcld2 | ⊢ (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | brfvrcld2.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ V) | |
2 | 1 | brfvrcld 41188 | . 2 ⊢ (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ (𝐴(𝑅↑𝑟0)𝐵 ∨ 𝐴(𝑅↑𝑟1)𝐵))) |
3 | relexp0g 14661 | . . . . . 6 ⊢ (𝑅 ∈ V → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) | |
4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝑅↑𝑟0) = ( I ↾ (dom 𝑅 ∪ ran 𝑅))) |
5 | 4 | breqd 5081 | . . . 4 ⊢ (𝜑 → (𝐴(𝑅↑𝑟0)𝐵 ↔ 𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵)) |
6 | relres 5909 | . . . . . . . 8 ⊢ Rel ( I ↾ (dom 𝑅 ∪ ran 𝑅)) | |
7 | 6 | releldmi 5846 | . . . . . . 7 ⊢ (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 → 𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅))) |
8 | 6 | relelrni 5847 | . . . . . . 7 ⊢ (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 → 𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) |
9 | dmresi 5950 | . . . . . . . . . 10 ⊢ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅) | |
10 | 9 | eleq2i 2830 | . . . . . . . . 9 ⊢ (𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ 𝐴 ∈ (dom 𝑅 ∪ ran 𝑅)) |
11 | 10 | biimpi 215 | . . . . . . . 8 ⊢ (𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) → 𝐴 ∈ (dom 𝑅 ∪ ran 𝑅)) |
12 | rnresi 5972 | . . . . . . . . . 10 ⊢ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) = (dom 𝑅 ∪ ran 𝑅) | |
13 | 12 | eleq2i 2830 | . . . . . . . . 9 ⊢ (𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ↔ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) |
14 | 13 | biimpi 215 | . . . . . . . 8 ⊢ (𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅)) → 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) |
15 | 11, 14 | anim12i 612 | . . . . . . 7 ⊢ ((𝐴 ∈ dom ( I ↾ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐵 ∈ ran ( I ↾ (dom 𝑅 ∪ ran 𝑅))) → (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅))) |
16 | 7, 8, 15 | syl2anc 583 | . . . . . 6 ⊢ (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 → (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅))) |
17 | resieq 5891 | . . . . . 6 ⊢ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) → (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ 𝐴 = 𝐵)) | |
18 | 16, 17 | biadanii 818 | . . . . 5 ⊢ (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐴 = 𝐵)) |
19 | df-3an 1087 | . . . . 5 ⊢ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅)) ∧ 𝐴 = 𝐵)) | |
20 | 18, 19 | bitr4i 277 | . . . 4 ⊢ (𝐴( I ↾ (dom 𝑅 ∪ ran 𝑅))𝐵 ↔ (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵)) |
21 | 5, 20 | bitrdi 286 | . . 3 ⊢ (𝜑 → (𝐴(𝑅↑𝑟0)𝐵 ↔ (𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵))) |
22 | 1 | relexp1d 14668 | . . . 4 ⊢ (𝜑 → (𝑅↑𝑟1) = 𝑅) |
23 | 22 | breqd 5081 | . . 3 ⊢ (𝜑 → (𝐴(𝑅↑𝑟1)𝐵 ↔ 𝐴𝑅𝐵)) |
24 | 21, 23 | orbi12d 915 | . 2 ⊢ (𝜑 → ((𝐴(𝑅↑𝑟0)𝐵 ∨ 𝐴(𝑅↑𝑟1)𝐵) ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵))) |
25 | 2, 24 | bitrd 278 | 1 ⊢ (𝜑 → (𝐴(r*‘𝑅)𝐵 ↔ ((𝐴 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐵 ∈ (dom 𝑅 ∪ ran 𝑅) ∧ 𝐴 = 𝐵) ∨ 𝐴𝑅𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∪ cun 3881 class class class wbr 5070 I cid 5479 dom cdm 5580 ran crn 5581 ↾ cres 5582 ‘cfv 6418 (class class class)co 7255 0cc0 10802 1c1 10803 ↑𝑟crelexp 14658 r*crcl 41169 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-seq 13650 df-relexp 14659 df-rcl 41170 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |