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 31658
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 sbcco 3700 . 2 ([𝐺 / ][ / 𝑓]𝜒[𝐺 / 𝑓]𝜒)
3 bnj976.5 . . 3 𝐺 ∈ V
4 bnj252 31582 . . . . . 6 ((𝑁𝐷𝑓 Fn 𝑁𝜑𝜓) ↔ (𝑁𝐷 ∧ (𝑓 Fn 𝑁𝜑𝜓)))
54sbcbii 3728 . . . . 5 ([ / 𝑓](𝑁𝐷𝑓 Fn 𝑁𝜑𝜓) ↔ [ / 𝑓](𝑁𝐷 ∧ (𝑓 Fn 𝑁𝜑𝜓)))
6 bnj976.1 . . . . . 6 (𝜒 ↔ (𝑁𝐷𝑓 Fn 𝑁𝜑𝜓))
76sbcbii 3728 . . . . 5 ([ / 𝑓]𝜒[ / 𝑓](𝑁𝐷𝑓 Fn 𝑁𝜑𝜓))
8 vex 3412 . . . . . . . 8 ∈ V
98bnj525 31618 . . . . . . 7 ([ / 𝑓]𝑁𝐷𝑁𝐷)
10 sbc3an 3737 . . . . . . . 8 ([ / 𝑓](𝑓 Fn 𝑁𝜑𝜓) ↔ ([ / 𝑓]𝑓 Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓))
11 bnj62 31599 . . . . . . . . 9 ([ / 𝑓]𝑓 Fn 𝑁 Fn 𝑁)
12113anbi1i 1137 . . . . . . . 8 (([ / 𝑓]𝑓 Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓) ↔ ( Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓))
1310, 12bitri 267 . . . . . . 7 ([ / 𝑓](𝑓 Fn 𝑁𝜑𝜓) ↔ ( Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓))
149, 13anbi12i 617 . . . . . 6 (([ / 𝑓]𝑁𝐷[ / 𝑓](𝑓 Fn 𝑁𝜑𝜓)) ↔ (𝑁𝐷 ∧ ( Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓)))
15 sbcan 3721 . . . . . 6 ([ / 𝑓](𝑁𝐷 ∧ (𝑓 Fn 𝑁𝜑𝜓)) ↔ ([ / 𝑓]𝑁𝐷[ / 𝑓](𝑓 Fn 𝑁𝜑𝜓)))
16 bnj252 31582 . . . . . 6 ((𝑁𝐷 Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓) ↔ (𝑁𝐷 ∧ ( Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓)))
1714, 15, 163bitr4ri 296 . . . . 5 ((𝑁𝐷 Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓) ↔ [ / 𝑓](𝑁𝐷 ∧ (𝑓 Fn 𝑁𝜑𝜓)))
185, 7, 173bitr4i 295 . . . 4 ([ / 𝑓]𝜒 ↔ (𝑁𝐷 Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓))
19 fneq1 6271 . . . . . . 7 ( = 𝐺 → ( Fn 𝑁𝐺 Fn 𝑁))
20 sbceq1a 3688 . . . . . . . 8 ( = 𝐺 → ([ / 𝑓]𝜑[𝐺 / ][ / 𝑓]𝜑))
21 bnj976.2 . . . . . . . . 9 (𝜑′[𝐺 / 𝑓]𝜑)
22 sbcco 3700 . . . . . . . . 9 ([𝐺 / ][ / 𝑓]𝜑[𝐺 / 𝑓]𝜑)
2321, 22bitr4i 270 . . . . . . . 8 (𝜑′[𝐺 / ][ / 𝑓]𝜑)
2420, 23syl6bbr 281 . . . . . . 7 ( = 𝐺 → ([ / 𝑓]𝜑𝜑′))
25 sbceq1a 3688 . . . . . . . 8 ( = 𝐺 → ([ / 𝑓]𝜓[𝐺 / ][ / 𝑓]𝜓))
26 bnj976.3 . . . . . . . . 9 (𝜓′[𝐺 / 𝑓]𝜓)
27 sbcco 3700 . . . . . . . . 9 ([𝐺 / ][ / 𝑓]𝜓[𝐺 / 𝑓]𝜓)
2826, 27bitr4i 270 . . . . . . . 8 (𝜓′[𝐺 / ][ / 𝑓]𝜓)
2925, 28syl6bbr 281 . . . . . . 7 ( = 𝐺 → ([ / 𝑓]𝜓𝜓′))
3019, 24, 293anbi123d 1415 . . . . . 6 ( = 𝐺 → (( Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓) ↔ (𝐺 Fn 𝑁𝜑′𝜓′)))
3130anbi2d 619 . . . . 5 ( = 𝐺 → ((𝑁𝐷 ∧ ( Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓)) ↔ (𝑁𝐷 ∧ (𝐺 Fn 𝑁𝜑′𝜓′))))
32 bnj252 31582 . . . . 5 ((𝑁𝐷𝐺 Fn 𝑁𝜑′𝜓′) ↔ (𝑁𝐷 ∧ (𝐺 Fn 𝑁𝜑′𝜓′)))
3331, 16, 323bitr4g 306 . . . 4 ( = 𝐺 → ((𝑁𝐷 Fn 𝑁[ / 𝑓]𝜑[ / 𝑓]𝜓) ↔ (𝑁𝐷𝐺 Fn 𝑁𝜑′𝜓′)))
3418, 33syl5bb 275 . . 3 ( = 𝐺 → ([ / 𝑓]𝜒 ↔ (𝑁𝐷𝐺 Fn 𝑁𝜑′𝜓′)))
353, 34sbcie 3712 . 2 ([𝐺 / ][ / 𝑓]𝜒 ↔ (𝑁𝐷𝐺 Fn 𝑁𝜑′𝜓′))
361, 2, 353bitr2i 291 1 (𝜒′ ↔ (𝑁𝐷𝐺 Fn 𝑁𝜑′𝜓′))
Colors of variables: wff setvar class
Syntax hints:  wb 198  wa 387  w3a 1068   = wceq 1507  wcel 2048  Vcvv 3409  [wsbc 3677   Fn wfn 6177  w-bnj17 31565
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-rab 3091  df-v 3411  df-sbc 3678  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-nul 4174  df-if 4345  df-sn 4436  df-pr 4438  df-op 4442  df-br 4924  df-opab 4986  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-fun 6184  df-fn 6185  df-bnj17 31566
This theorem is referenced by:  bnj910  31828  bnj999  31837  bnj907  31845
  Copyright terms: Public domain W3C validator