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 732 | . 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜒)) |
4 | brabg.5 | . 2 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
5 | 3, 4 | brabga 4914 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴𝑅𝐵 ↔ 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 class class class wbr 4583 {copab 4642 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 |
This theorem is referenced by: brab 4923 ideqg 5195 opelcnvg 5224 f1owe 6503 brrpssg 6837 bren 7850 brdomg 7851 brwdom 8355 ltprord 9731 shftfib 13660 efgrelexlema 17985 isref 21122 istrkgld 25158 islnopp 25431 axcontlem5 25648 isfrgra 26517 cmbr 27827 leopg 28365 cvbr 28525 mdbr 28537 dmdbr 28542 soseq 30995 sltval 31044 isfne 31504 brabg2 32680 isriscg 32953 lcvbr 33326 |
Copyright terms: Public domain | W3C validator |