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

Theorem bnj1542 31534
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1542.1 (𝜑𝐹 Fn 𝐴)
bnj1542.2 (𝜑𝐺 Fn 𝐴)
bnj1542.3 (𝜑𝐹𝐺)
bnj1542.4 (𝑤𝐹 → ∀𝑥 𝑤𝐹)
Assertion
Ref Expression
bnj1542 (𝜑 → ∃𝑥𝐴 (𝐹𝑥) ≠ (𝐺𝑥))
Distinct variable groups:   𝑥,𝐴   𝑤,𝐹   𝑤,𝐺,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑤)   𝐴(𝑤)   𝐹(𝑥)

Proof of Theorem bnj1542
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 bnj1542.3 . . 3 (𝜑𝐹𝐺)
2 bnj1542.1 . . . 4 (𝜑𝐹 Fn 𝐴)
3 bnj1542.2 . . . 4 (𝜑𝐺 Fn 𝐴)
4 eqfnfv 6576 . . . . . 6 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑦𝐴 (𝐹𝑦) = (𝐺𝑦)))
54necon3abid 3005 . . . . 5 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹𝐺 ↔ ¬ ∀𝑦𝐴 (𝐹𝑦) = (𝐺𝑦)))
6 df-ne 2970 . . . . . . 7 ((𝐹𝑦) ≠ (𝐺𝑦) ↔ ¬ (𝐹𝑦) = (𝐺𝑦))
76rexbii 3224 . . . . . 6 (∃𝑦𝐴 (𝐹𝑦) ≠ (𝐺𝑦) ↔ ∃𝑦𝐴 ¬ (𝐹𝑦) = (𝐺𝑦))
8 rexnal 3176 . . . . . 6 (∃𝑦𝐴 ¬ (𝐹𝑦) = (𝐺𝑦) ↔ ¬ ∀𝑦𝐴 (𝐹𝑦) = (𝐺𝑦))
97, 8bitri 267 . . . . 5 (∃𝑦𝐴 (𝐹𝑦) ≠ (𝐺𝑦) ↔ ¬ ∀𝑦𝐴 (𝐹𝑦) = (𝐺𝑦))
105, 9syl6bbr 281 . . . 4 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹𝐺 ↔ ∃𝑦𝐴 (𝐹𝑦) ≠ (𝐺𝑦)))
112, 3, 10syl2anc 579 . . 3 (𝜑 → (𝐹𝐺 ↔ ∃𝑦𝐴 (𝐹𝑦) ≠ (𝐺𝑦)))
121, 11mpbid 224 . 2 (𝜑 → ∃𝑦𝐴 (𝐹𝑦) ≠ (𝐺𝑦))
13 nfv 1957 . . 3 𝑦(𝐹𝑥) ≠ (𝐺𝑥)
14 bnj1542.4 . . . . . 6 (𝑤𝐹 → ∀𝑥 𝑤𝐹)
1514nfcii 2923 . . . . 5 𝑥𝐹
16 nfcv 2934 . . . . 5 𝑥𝑦
1715, 16nffv 6458 . . . 4 𝑥(𝐹𝑦)
18 nfcv 2934 . . . 4 𝑥(𝐺𝑦)
1917, 18nfne 3072 . . 3 𝑥(𝐹𝑦) ≠ (𝐺𝑦)
20 fveq2 6448 . . . 4 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
21 fveq2 6448 . . . 4 (𝑥 = 𝑦 → (𝐺𝑥) = (𝐺𝑦))
2220, 21neeq12d 3030 . . 3 (𝑥 = 𝑦 → ((𝐹𝑥) ≠ (𝐺𝑥) ↔ (𝐹𝑦) ≠ (𝐺𝑦)))
2313, 19, 22cbvrex 3364 . 2 (∃𝑥𝐴 (𝐹𝑥) ≠ (𝐺𝑥) ↔ ∃𝑦𝐴 (𝐹𝑦) ≠ (𝐺𝑦))
2412, 23sylibr 226 1 (𝜑 → ∃𝑥𝐴 (𝐹𝑥) ≠ (𝐺𝑥))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 386  wal 1599   = wceq 1601  wcel 2107  wne 2969  wral 3090  wrex 3091   Fn wfn 6132  cfv 6137
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5019  ax-nul 5027  ax-pow 5079  ax-pr 5140
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4674  df-br 4889  df-opab 4951  df-mpt 4968  df-id 5263  df-xp 5363  df-rel 5364  df-cnv 5365  df-co 5366  df-dm 5367  df-rn 5368  df-res 5369  df-ima 5370  df-iota 6101  df-fun 6139  df-fn 6140  df-fv 6145
This theorem is referenced by:  bnj1523  31746
  Copyright terms: Public domain W3C validator