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

Theorem bnj976 35520
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj976.1 (𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓))
bnj976.2 (𝜑′ ↔ [𝐺 / 𝑓]𝜑)
bnj976.3 (𝜓′ ↔ [𝐺 / 𝑓]𝜓)
bnj976.4 (𝜒′ ↔ [𝐺 / 𝑓]𝜒)
bnj976.5 𝐺 ∈ V
Assertion
Ref Expression
bnj976 (𝜒′ ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))
Distinct variable groups:   𝐷,𝑓   𝑓,𝑁
Allowed substitution hints:   𝜑(𝑓)   𝜓(𝑓)   𝜒(𝑓)   𝐺(𝑓)   𝜑′(𝑓)   𝜓′(𝑓)   𝜒′(𝑓)

Proof of Theorem bnj976
Dummy variable ℎ is distinct from all other variables.
StepHypRef Expression
1 bnj976.4 . 2 (𝜒′ ↔ [𝐺 / 𝑓]𝜒)
2 sbccow 3764 . 2 ([𝐺 / ℎ][ℎ / 𝑓]𝜒 ↔ [𝐺 / 𝑓]𝜒)
3 bnj976.5 . . 3 𝐺 ∈ V
4 bnj252 35446 . . . . . 6 ((𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ (𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
54sbcbii 3797 . . . . 5 ([ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ [ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
6 bnj976.1 . . . . . 6 (𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓))
76sbcbii 3797 . . . . 5 ([ℎ / 𝑓]𝜒 ↔ [ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓))
8 vex 3457 . . . . . . . 8 ℎ ∈ V
98bnj525 35481 . . . . . . 7 ([ℎ / 𝑓]𝑁 ∈ 𝐷 ↔ 𝑁 ∈ 𝐷)
10 sbc3an 3805 . . . . . . . 8 ([ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ ([ℎ / 𝑓]𝑓 Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
11 bnj62 35463 . . . . . . . . 9 ([ℎ / 𝑓]𝑓 Fn 𝑁 ↔ ℎ Fn 𝑁)
12113anbi1i 1176 . . . . . . . 8 (([ℎ / 𝑓]𝑓 Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
1310, 12bitri 278 . . . . . . 7 ([ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
149, 13anbi12i 640 . . . . . 6 (([ℎ / 𝑓]𝑁 ∈ 𝐷 ∧ [ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)) ↔ (𝑁 ∈ 𝐷 ∧ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓)))
15 sbcan 3790 . . . . . 6 ([ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)) ↔ ([ℎ / 𝑓]𝑁 ∈ 𝐷 ∧ [ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
16 bnj252 35446 . . . . . 6 ((𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (𝑁 ∈ 𝐷 ∧ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓)))
1714, 15, 163bitr4ri 307 . . . . 5 ((𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ [ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
185, 7, 173bitr4i 306 . . . 4 ([ℎ / 𝑓]𝜒 ↔ (𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
19 fneq1 6659 . . . . . . 7 (ℎ = 𝐺 → (ℎ Fn 𝑁 ↔ 𝐺 Fn 𝑁))
20 sbceq1a 3752 . . . . . . . 8 (ℎ = 𝐺 → ([ℎ / 𝑓]𝜑 ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜑))
21 bnj976.2 . . . . . . . . 9 (𝜑′ ↔ [𝐺 / 𝑓]𝜑)
22 sbccow 3764 . . . . . . . . 9 ([𝐺 / ℎ][ℎ / 𝑓]𝜑 ↔ [𝐺 / 𝑓]𝜑)
2321, 22bitr4i 281 . . . . . . . 8 (𝜑′ ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜑)
2420, 23bitr4di 292 . . . . . . 7 (ℎ = 𝐺 → ([ℎ / 𝑓]𝜑 ↔ 𝜑′))
25 sbceq1a 3752 . . . . . . . 8 (ℎ = 𝐺 → ([ℎ / 𝑓]𝜓 ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜓))
26 bnj976.3 . . . . . . . . 9 (𝜓′ ↔ [𝐺 / 𝑓]𝜓)
27 sbccow 3764 . . . . . . . . 9 ([𝐺 / ℎ][ℎ / 𝑓]𝜓 ↔ [𝐺 / 𝑓]𝜓)
2826, 27bitr4i 281 . . . . . . . 8 (𝜓′ ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜓)
2925, 28bitr4di 292 . . . . . . 7 (ℎ = 𝐺 → ([ℎ / 𝑓]𝜓 ↔ 𝜓′))
3019, 24, 293anbi123d 1467 . . . . . 6 (ℎ = 𝐺 → ((ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
3130anbi2d 642 . . . . 5 (ℎ = 𝐺 → ((𝑁 ∈ 𝐷 ∧ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓)) ↔ (𝑁 ∈ 𝐷 ∧ (𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))))
32 bnj252 35446 . . . . 5 ((𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′) ↔ (𝑁 ∈ 𝐷 ∧ (𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
3331, 16, 323bitr4g 317 . . . 4 (ℎ = 𝐺 → ((𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
3418, 33bitrid 286 . . 3 (ℎ = 𝐺 → ([ℎ / 𝑓]𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
353, 34sbcie 3782 . 2 ([𝐺 / ℎ][ℎ / 𝑓]𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))
361, 2, 353bitr2i 302 1 (𝜒′ ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  Vcvv 3453  [wsbc 3741   Fn wfn 6560   ∧ w-bnj17 35429
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-12 2219  ax-ext 2738
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-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108  df-opab 5173  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-fun 6567  df-fn 6568  df-bnj17 35430
This theorem is used by:  bnj910  35690  bnj999  35700  bnj907  35709
  Copyright terms: Public domain W3C validator