![]() |
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 505 | . 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜒)) |
4 | brabg.5 | . 2 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
5 | 3, 4 | brabga 5226 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 = wceq 1601 ∈ wcel 2107 class class class wbr 4886 {copab 4948 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5017 ax-nul 5025 ax-pr 5138 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-rab 3099 df-v 3400 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-nul 4142 df-if 4308 df-sn 4399 df-pr 4401 df-op 4405 df-br 4887 df-opab 4949 |
This theorem is referenced by: brab 5235 ideqg 5519 brcnvg 5547 f1owe 6875 brrpssg 7216 bren 8250 brdomg 8251 brwdom 8761 ltprord 10187 shftfib 14219 efgrelexlema 18548 isref 21721 istrkgld 25810 islnopp 26087 axcontlem5 26317 cmbr 29015 leopg 29553 cvbr 29713 mdbr 29725 dmdbr 29730 soseq 32343 sltval 32389 brsslt 32489 isfne 32922 brabg2 34135 isriscg 34407 brssr 34879 lcvbr 35175 |
Copyright terms: Public domain | W3C validator |