| 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 519 | . 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜒)) |
| 4 | brabg.5 | . 2 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
| 5 | 3, 4 | brabga 5514 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 class class class wbr 5107 {copab 5172 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 |
| This theorem is used by: brab 5524 ideqg 5838 brcnvg 5868 f1owe 7391 f1oweOLD 7392 brrpssg 7772 soseq 8212 breng 9019 brdom2g 9021 brwdom 9597 brttrcl 9750 ltprord 11153 shftfib 15267 efgrelexlema 20016 isref 23885 ltsval 28063 brslts 28207 lrrecval 28384 istrkgld 28980 islnopp 29274 axcontlem5 29605 cmbr 32245 leopg 32783 cvbr 32943 mdbr 32955 dmdbr 32960 isfne 37343 brabg2 38921 isriscg 39186 brssr 39781 lcvbr 40346 bropabg 44646 |
| Copyright terms: Public domain | W3C validator |