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 35612
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 3797 . 2 ([1o / 𝑛]𝜁 ↔ [1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
3 bnj121.2 . 2 (𝜁′ ↔ [1o / 𝑛]𝜁)
4 bnj105 35467 . . . . . . . 8 1o ∈ V
54bnj90 35465 . . . . . . 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 1174 . . . . 5 ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ ([1o / 𝑛]𝑓 Fn 𝑛 ∧ [1o / 𝑛]𝜑 ∧ [1o / 𝑛]𝜓))
10 sbc3an 3805 . . . . 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 1951 . . . . 5 Ⅎ𝑛(𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴)
1413sbc19.21g 3812 . . . 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
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   ∈ wcel 2150  Vcvv 3453  [wsbc 3741   Fn wfn 6560  1oc1o 8506   FrSe w-bnj15 35435
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-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333
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-clab 2745  df-cleq 2758  df-clel 2842  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-pw 4561  df-sn 4588  df-suc 6393  df-fn 6568  df-1o 8513
This theorem is used by:  bnj150  35618  bnj153  35622
  Copyright terms: Public domain W3C validator