MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  predbrg Structured version   Visualization version   GIF version

Theorem predbrg 6162
Description: Closed form of elpredim 6154. (Contributed by Scott Fenton, 13-Apr-2011.) (Revised by NM, 5-Apr-2016.)
Assertion
Ref Expression
predbrg ((𝑋𝑉𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)) → 𝑌𝑅𝑋)

Proof of Theorem predbrg
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 predeq3 6146 . . . . 5 (𝑥 = 𝑋 → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑅, 𝐴, 𝑋))
21eleq2d 2898 . . . 4 (𝑥 = 𝑋 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑥) ↔ 𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)))
3 breq2 5062 . . . 4 (𝑥 = 𝑋 → (𝑌𝑅𝑥𝑌𝑅𝑋))
42, 3imbi12d 347 . . 3 (𝑥 = 𝑋 → ((𝑌 ∈ Pred(𝑅, 𝐴, 𝑥) → 𝑌𝑅𝑥) ↔ (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌𝑅𝑋)))
5 vex 3497 . . . 4 𝑥 ∈ V
65elpredim 6154 . . 3 (𝑌 ∈ Pred(𝑅, 𝐴, 𝑥) → 𝑌𝑅𝑥)
74, 6vtoclg 3567 . 2 (𝑋𝑉 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑌𝑅𝑋))
87imp 409 1 ((𝑋𝑉𝑌 ∈ Pred(𝑅, 𝐴, 𝑋)) → 𝑌𝑅𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110   class class class wbr 5058  Predcpred 6141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059  df-opab 5121  df-xp 5555  df-cnv 5557  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator