Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj121 Structured version   Visualization version   GIF version

Theorem bnj121 35205
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj121.1 (𝜁 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
bnj121.2 (𝜁′[1o / 𝑛]𝜁)
bnj121.3 (𝜑′[1o / 𝑛]𝜑)
bnj121.4 (𝜓′[1o / 𝑛]𝜓)
Assertion
Ref Expression
bnj121 (𝜁′ ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o𝜑′𝜓′)))
Distinct variable groups:   𝐴,𝑛   𝑅,𝑛   𝑓,𝑛   𝑥,𝑛
Allowed substitution hints:   𝜑(𝑥,𝑓,𝑛)   𝜓(𝑥,𝑓,𝑛)   𝜁(𝑥,𝑓,𝑛)   𝐴(𝑥,𝑓)   𝑅(𝑥,𝑓)   𝜑′(𝑥,𝑓,𝑛)   𝜓′(𝑥,𝑓,𝑛)   𝜁′(𝑥,𝑓,𝑛)

Proof of Theorem bnj121
StepHypRef Expression
1 bnj121.1 . . 3 (𝜁 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
21sbcbii 3809 . 2 ([1o / 𝑛]𝜁[1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
3 bnj121.2 . 2 (𝜁′[1o / 𝑛]𝜁)
4 bnj105 35060 . . . . . . . 8 1o ∈ V
54bnj90 35058 . . . . . . 7 ([1o / 𝑛]𝑓 Fn 𝑛𝑓 Fn 1o)
65bicomi 227 . . . . . 6 (𝑓 Fn 1o[1o / 𝑛]𝑓 Fn 𝑛)
7 bnj121.3 . . . . . 6 (𝜑′[1o / 𝑛]𝜑)
8 bnj121.4 . . . . . 6 (𝜓′[1o / 𝑛]𝜓)
96, 7, 83anbi123i 1171 . . . . 5 ((𝑓 Fn 1o𝜑′𝜓′) ↔ ([1o / 𝑛]𝑓 Fn 𝑛[1o / 𝑛]𝜑[1o / 𝑛]𝜓))
10 sbc3an 3817 . . . . 5 ([1o / 𝑛](𝑓 Fn 𝑛𝜑𝜓) ↔ ([1o / 𝑛]𝑓 Fn 𝑛[1o / 𝑛]𝜑[1o / 𝑛]𝜓))
119, 10bitr4i 281 . . . 4 ((𝑓 Fn 1o𝜑′𝜓′) ↔ [1o / 𝑛](𝑓 Fn 𝑛𝜑𝜓))
1211imbi2i 339 . . 3 (((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o𝜑′𝜓′)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → [1o / 𝑛](𝑓 Fn 𝑛𝜑𝜓)))
13 nfv 1941 . . . . 5 𝑛(𝑅 FrSe 𝐴𝑥𝐴)
1413sbc19.21g 3824 . . . 4 (1o ∈ V → ([1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → [1o / 𝑛](𝑓 Fn 𝑛𝜑𝜓))))
154, 14ax-mp 5 . . 3 ([1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → [1o / 𝑛](𝑓 Fn 𝑛𝜑𝜓)))
1612, 15bitr4i 281 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o𝜑′𝜓′)) ↔ [1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
172, 3, 163bitr4i 306 1 (𝜁′ ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o𝜑′𝜓′)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101  wcel 2149  Vcvv 3463  [wsbc 3753   Fn wfn 6534  1oc1o 8448   FrSe w-bnj15 35028
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5273  ax-pow 5339
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-pw 4569  df-sn 4595  df-suc 6369  df-fn 6542  df-1o 8455
This theorem is referenced by:  bnj150  35211  bnj153  35215
  Copyright terms: Public domain W3C validator