Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > brab | GIF version |
Description: The law of concretion for a binary relation. (Contributed by NM, 16-Aug-1999.) |
Ref | Expression |
---|---|
opelopab.1 | ⊢ 𝐴 ∈ V |
opelopab.2 | ⊢ 𝐵 ∈ V |
opelopab.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
opelopab.4 | ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) |
brab.5 | ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} |
Ref | Expression |
---|---|
brab | ⊢ (𝐴𝑅𝐵 ↔ 𝜒) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelopab.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | opelopab.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | opelopab.3 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
4 | opelopab.4 | . . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
5 | brab.5 | . . 3 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
6 | 3, 4, 5 | brabg 4006 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵 ↔ 𝜒)) |
7 | 1, 2, 6 | mp2an 402 | 1 ⊢ (𝐴𝑅𝐵 ↔ 𝜒) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 98 = wceq 1243 ∈ wcel 1393 Vcvv 2557 class class class wbr 3764 {copab 3817 |
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-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 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 |
This theorem is referenced by: dftpos4 5878 enq0sym 6530 enq0ref 6531 enq0tr 6532 shftfn 9425 |
Copyright terms: Public domain | W3C validator |