Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brsuccf Structured version   Visualization version   GIF version

Theorem brsuccf 36920
Description: Binary relation form of the Succ function. (Contributed by Scott Fenton, 14-Apr-2014.)
Hypotheses
Ref Expression
brsuccf.1 𝐴 ∈ V
brsuccf.2 𝐵 ∈ V
Assertion
Ref Expression
brsuccf (𝐴Succ𝐵 ↔ 𝐵 = suc 𝐴)

Proof of Theorem brsuccf
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 df-succf 36850 . . 3 Succ = (Cup ∘ ( I ⊗ Singleton))
21breqi 5113 . 2 (𝐴Succ𝐵 ↔ 𝐴(Cup ∘ ( I ⊗ Singleton))𝐵)
3 brsuccf.1 . . 3 𝐴 ∈ V
4 brsuccf.2 . . 3 𝐵 ∈ V
53, 4brco 5859 . 2 (𝐴(Cup ∘ ( I ⊗ Singleton))𝐵 ↔ ∃𝑥(𝐴( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝐵))
63, 4lemsuccf 36919 . 2 (∃𝑥(𝐴( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝐵) ↔ 𝐵 = suc 𝐴)
72, 5, 63bitri 300 1 (𝐴Succ𝐵 ↔ 𝐵 = suc 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  Vcvv 3453   class class class wbr 5107   I cid 5551   ∘ ccom 5661  suc csuc 6389   ⊗ ctxp 36808  Singletoncsingle 36816  Cupccup 36824  Succcsuccf 36826
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-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
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-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-symdif 4200  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-eprel 5557  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fo 6571  df-fv 6573  df-1st 8034  df-2nd 8035  df-txp 36832  df-singleton 36840  df-cup 36847  df-succf 36850
This theorem is used by:  dfrdg4  36931
  Copyright terms: Public domain W3C validator