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

Theorem bnj1385 31449
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1385.1 (𝜑 ↔ ∀𝑓𝐴 Fun 𝑓)
bnj1385.2 𝐷 = (dom 𝑓 ∩ dom 𝑔)
bnj1385.3 (𝜓 ↔ (𝜑 ∧ ∀𝑓𝐴𝑔𝐴 (𝑓𝐷) = (𝑔𝐷)))
bnj1385.4 (𝑥𝐴 → ∀𝑓 𝑥𝐴)
bnj1385.5 (𝜑′ ↔ ∀𝐴 Fun )
bnj1385.6 𝐸 = (dom ∩ dom 𝑔)
bnj1385.7 (𝜓′ ↔ (𝜑′ ∧ ∀𝐴𝑔𝐴 (𝐸) = (𝑔𝐸)))
Assertion
Ref Expression
bnj1385 (𝜓 → Fun 𝐴)
Distinct variable groups:   𝐴,𝑔,,𝑥   𝐷,   𝑓,𝐸   𝑓,𝑔,,𝑥   𝑔,𝜑′
Allowed substitution hints:   𝜑(𝑥,𝑓,𝑔,)   𝜓(𝑥,𝑓,𝑔,)   𝐴(𝑓)   𝐷(𝑥,𝑓,𝑔)   𝐸(𝑥,𝑔,)   𝜑′(𝑥,𝑓,)   𝜓′(𝑥,𝑓,𝑔,)

Proof of Theorem bnj1385
StepHypRef Expression
1 nfv 2015 . . . . . . 7 (𝑓𝐴 → Fun 𝑓)
2 bnj1385.4 . . . . . . . . . 10 (𝑥𝐴 → ∀𝑓 𝑥𝐴)
32nfcii 2960 . . . . . . . . 9 𝑓𝐴
43nfcri 2963 . . . . . . . 8 𝑓 𝐴
5 nfv 2015 . . . . . . . 8 𝑓Fun
64, 5nfim 2001 . . . . . . 7 𝑓(𝐴 → Fun )
7 eleq1w 2889 . . . . . . . 8 (𝑓 = → (𝑓𝐴𝐴))
8 funeq 6143 . . . . . . . 8 (𝑓 = → (Fun 𝑓 ↔ Fun ))
97, 8imbi12d 336 . . . . . . 7 (𝑓 = → ((𝑓𝐴 → Fun 𝑓) ↔ (𝐴 → Fun )))
101, 6, 9cbvalv1 2369 . . . . . 6 (∀𝑓(𝑓𝐴 → Fun 𝑓) ↔ ∀(𝐴 → Fun ))
11 df-ral 3122 . . . . . 6 (∀𝑓𝐴 Fun 𝑓 ↔ ∀𝑓(𝑓𝐴 → Fun 𝑓))
12 df-ral 3122 . . . . . 6 (∀𝐴 Fun ↔ ∀(𝐴 → Fun ))
1310, 11, 123bitr4i 295 . . . . 5 (∀𝑓𝐴 Fun 𝑓 ↔ ∀𝐴 Fun )
14 bnj1385.1 . . . . 5 (𝜑 ↔ ∀𝑓𝐴 Fun 𝑓)
15 bnj1385.5 . . . . 5 (𝜑′ ↔ ∀𝐴 Fun )
1613, 14, 153bitr4i 295 . . . 4 (𝜑𝜑′)
17 nfv 2015 . . . . . 6 (𝑓𝐴 → ∀𝑔𝐴 (𝑓𝐷) = (𝑔𝐷))
18 nfv 2015 . . . . . . . 8 𝑓(𝐸) = (𝑔𝐸)
193, 18nfral 3154 . . . . . . 7 𝑓𝑔𝐴 (𝐸) = (𝑔𝐸)
204, 19nfim 2001 . . . . . 6 𝑓(𝐴 → ∀𝑔𝐴 (𝐸) = (𝑔𝐸))
21 dmeq 5556 . . . . . . . . . . . . 13 (𝑓 = → dom 𝑓 = dom )
2221ineq1d 4040 . . . . . . . . . . . 12 (𝑓 = → (dom 𝑓 ∩ dom 𝑔) = (dom ∩ dom 𝑔))
23 bnj1385.2 . . . . . . . . . . . 12 𝐷 = (dom 𝑓 ∩ dom 𝑔)
24 bnj1385.6 . . . . . . . . . . . 12 𝐸 = (dom ∩ dom 𝑔)
2522, 23, 243eqtr4g 2886 . . . . . . . . . . 11 (𝑓 = 𝐷 = 𝐸)
2625reseq2d 5629 . . . . . . . . . 10 (𝑓 = → (𝑓𝐷) = (𝑓𝐸))
27 reseq1 5623 . . . . . . . . . 10 (𝑓 = → (𝑓𝐸) = (𝐸))
2826, 27eqtrd 2861 . . . . . . . . 9 (𝑓 = → (𝑓𝐷) = (𝐸))
2925reseq2d 5629 . . . . . . . . 9 (𝑓 = → (𝑔𝐷) = (𝑔𝐸))
3028, 29eqeq12d 2840 . . . . . . . 8 (𝑓 = → ((𝑓𝐷) = (𝑔𝐷) ↔ (𝐸) = (𝑔𝐸)))
3130ralbidv 3195 . . . . . . 7 (𝑓 = → (∀𝑔𝐴 (𝑓𝐷) = (𝑔𝐷) ↔ ∀𝑔𝐴 (𝐸) = (𝑔𝐸)))
327, 31imbi12d 336 . . . . . 6 (𝑓 = → ((𝑓𝐴 → ∀𝑔𝐴 (𝑓𝐷) = (𝑔𝐷)) ↔ (𝐴 → ∀𝑔𝐴 (𝐸) = (𝑔𝐸))))
3317, 20, 32cbvalv1 2369 . . . . 5 (∀𝑓(𝑓𝐴 → ∀𝑔𝐴 (𝑓𝐷) = (𝑔𝐷)) ↔ ∀(𝐴 → ∀𝑔𝐴 (𝐸) = (𝑔𝐸)))
34 df-ral 3122 . . . . 5 (∀𝑓𝐴𝑔𝐴 (𝑓𝐷) = (𝑔𝐷) ↔ ∀𝑓(𝑓𝐴 → ∀𝑔𝐴 (𝑓𝐷) = (𝑔𝐷)))
35 df-ral 3122 . . . . 5 (∀𝐴𝑔𝐴 (𝐸) = (𝑔𝐸) ↔ ∀(𝐴 → ∀𝑔𝐴 (𝐸) = (𝑔𝐸)))
3633, 34, 353bitr4i 295 . . . 4 (∀𝑓𝐴𝑔𝐴 (𝑓𝐷) = (𝑔𝐷) ↔ ∀𝐴𝑔𝐴 (𝐸) = (𝑔𝐸))
3716, 36anbi12i 622 . . 3 ((𝜑 ∧ ∀𝑓𝐴𝑔𝐴 (𝑓𝐷) = (𝑔𝐷)) ↔ (𝜑′ ∧ ∀𝐴𝑔𝐴 (𝐸) = (𝑔𝐸)))
38 bnj1385.3 . . 3 (𝜓 ↔ (𝜑 ∧ ∀𝑓𝐴𝑔𝐴 (𝑓𝐷) = (𝑔𝐷)))
39 bnj1385.7 . . 3 (𝜓′ ↔ (𝜑′ ∧ ∀𝐴𝑔𝐴 (𝐸) = (𝑔𝐸)))
4037, 38, 393bitr4i 295 . 2 (𝜓𝜓′)
4115, 24, 39bnj1383 31448 . 2 (𝜓′ → Fun 𝐴)
4240, 41sylbi 209 1 (𝜓 → Fun 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 386  wal 1656   = wceq 1658  wcel 2166  wral 3117  cin 3797   cuni 4658  dom cdm 5342  cres 5344  Fun wfun 6117
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-sep 5005  ax-nul 5013  ax-pr 5127
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ral 3122  df-rex 3123  df-rab 3126  df-v 3416  df-sbc 3663  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-iun 4742  df-br 4874  df-opab 4936  df-id 5250  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-res 5354  df-iota 6086  df-fun 6125  df-fv 6131
This theorem is referenced by:  bnj1386  31450
  Copyright terms: Public domain W3C validator