ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  braba GIF version

Theorem braba 4004
Description: The law of concretion for a binary relation. (Contributed by NM, 19-Dec-2013.)
Hypotheses
Ref Expression
opelopaba.1 𝐴 ∈ V
opelopaba.2 𝐵 ∈ V
opelopaba.3 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
braba.4 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Assertion
Ref Expression
braba (𝐴𝑅𝐵𝜓)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝑅(𝑥,𝑦)

Proof of Theorem braba
StepHypRef Expression
1 opelopaba.1 . 2 𝐴 ∈ V
2 opelopaba.2 . 2 𝐵 ∈ V
3 opelopaba.3 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝜑𝜓))
4 braba.4 . . 3 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
53, 4brabga 4001 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵𝜓))
61, 2, 5mp2an 402 1 (𝐴𝑅𝐵𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  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: (None)
  Copyright terms: Public domain W3C validator