Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > brabg | Structured version Visualization version GIF version |
Description: The law of concretion for a binary relation. (Contributed by NM, 16-Aug-1999.) (Revised by Mario Carneiro, 19-Dec-2013.) |
Ref | Expression |
---|---|
opelopabg.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
opelopabg.2 | ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) |
brabg.5 | ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} |
Ref | Expression |
---|---|
brabg | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelopabg.1 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
2 | opelopabg.2 | . . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
3 | 1, 2 | sylan9bb 510 | . 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜒)) |
4 | brabg.5 | . 2 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
5 | 3, 4 | brabga 5412 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 class class class wbr 5057 {copab 5119 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-br 5058 df-opab 5120 |
This theorem is referenced by: brab 5421 ideqg 5715 brcnvg 5743 f1owe 7095 brrpssg 7440 bren 8506 brdomg 8507 brwdom 9019 ltprord 10440 shftfib 14419 efgrelexlema 18804 isref 22045 istrkgld 26172 islnopp 26452 axcontlem5 26681 cmbr 29288 leopg 29826 cvbr 29986 mdbr 29998 dmdbr 30003 soseq 32993 sltval 33051 brsslt 33151 isfne 33584 brabg2 34872 isriscg 35143 brssr 35621 lcvbr 36037 |
Copyright terms: Public domain | W3C validator |