![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > brres | GIF version |
Description: Binary relation on a restriction. (Contributed by NM, 12-Dec-2006.) |
Ref | Expression |
---|---|
opelres.1 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
brres | ⊢ (𝐴(𝐶 ↾ 𝐷)𝐵 ↔ (𝐴𝐶𝐵 ∧ 𝐴 ∈ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelres.1 | . . 3 ⊢ 𝐵 ∈ V | |
2 | 1 | opelres 4617 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)) |
3 | df-br 3765 | . 2 ⊢ (𝐴(𝐶 ↾ 𝐷)𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷)) | |
4 | df-br 3765 | . . 3 ⊢ (𝐴𝐶𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐶) | |
5 | 4 | anbi1i 431 | . 2 ⊢ ((𝐴𝐶𝐵 ∧ 𝐴 ∈ 𝐷) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)) |
6 | 2, 3, 5 | 3bitr4i 201 | 1 ⊢ (𝐴(𝐶 ↾ 𝐷)𝐵 ↔ (𝐴𝐶𝐵 ∧ 𝐴 ∈ 𝐷)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 97 ↔ wb 98 ∈ wcel 1393 Vcvv 2557 〈cop 3378 class class class wbr 3764 ↾ cres 4347 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-br 3765 df-opab 3819 df-xp 4351 df-res 4357 |
This theorem is referenced by: dfres2 4658 dfima2 4670 poirr2 4717 cores 4824 resco 4825 rnco 4827 fnres 5015 fvres 5198 nfunsn 5207 1stconst 5842 2ndconst 5843 |
Copyright terms: Public domain | W3C validator |