ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rexrnmpt GIF version

Theorem rexrnmpt 5717
Description: A restricted quantifier over an image set. (Contributed by Mario Carneiro, 20-Aug-2015.)
Hypotheses
Ref Expression
ralrnmpt.1 𝐹 = (𝑥𝐴𝐵)
ralrnmpt.2 (𝑦 = 𝐵 → (𝜓𝜒))
Assertion
Ref Expression
rexrnmpt (∀𝑥𝐴 𝐵𝑉 → (∃𝑦 ∈ ran 𝐹𝜓 ↔ ∃𝑥𝐴 𝜒))
Distinct variable groups:   𝑥,𝐴   𝑦,𝐵   𝜒,𝑦   𝑦,𝐹   𝜓,𝑥
Allowed substitution hints:   𝜓(𝑦)   𝜒(𝑥)   𝐴(𝑦)   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem rexrnmpt
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ralrnmpt.1 . . . . 5 𝐹 = (𝑥𝐴𝐵)
21fnmpt 5396 . . . 4 (∀𝑥𝐴 𝐵𝑉𝐹 Fn 𝐴)
3 dfsbcq 2999 . . . . 5 (𝑤 = (𝐹𝑧) → ([𝑤 / 𝑦]𝜓[(𝐹𝑧) / 𝑦]𝜓))
43rexrn 5711 . . . 4 (𝐹 Fn 𝐴 → (∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∃𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
52, 4syl 14 . . 3 (∀𝑥𝐴 𝐵𝑉 → (∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∃𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
6 nfv 1550 . . . . 5 𝑤𝜓
7 nfsbc1v 3016 . . . . 5 𝑦[𝑤 / 𝑦]𝜓
8 sbceq1a 3007 . . . . 5 (𝑦 = 𝑤 → (𝜓[𝑤 / 𝑦]𝜓))
96, 7, 8cbvrex 2734 . . . 4 (∃𝑦 ∈ ran 𝐹𝜓 ↔ ∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓)
109bicomi 132 . . 3 (∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∃𝑦 ∈ ran 𝐹𝜓)
11 nfmpt1 4136 . . . . . . 7 𝑥(𝑥𝐴𝐵)
121, 11nfcxfr 2344 . . . . . 6 𝑥𝐹
13 nfcv 2347 . . . . . 6 𝑥𝑧
1412, 13nffv 5580 . . . . 5 𝑥(𝐹𝑧)
15 nfv 1550 . . . . 5 𝑥𝜓
1614, 15nfsbc 3018 . . . 4 𝑥[(𝐹𝑧) / 𝑦]𝜓
17 nfv 1550 . . . 4 𝑧[(𝐹𝑥) / 𝑦]𝜓
18 fveq2 5570 . . . . 5 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
1918sbceq1d 3002 . . . 4 (𝑧 = 𝑥 → ([(𝐹𝑧) / 𝑦]𝜓[(𝐹𝑥) / 𝑦]𝜓))
2016, 17, 19cbvrex 2734 . . 3 (∃𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓 ↔ ∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓)
215, 10, 203bitr3g 222 . 2 (∀𝑥𝐴 𝐵𝑉 → (∃𝑦 ∈ ran 𝐹𝜓 ↔ ∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓))
221fvmpt2 5657 . . . . . 6 ((𝑥𝐴𝐵𝑉) → (𝐹𝑥) = 𝐵)
2322sbceq1d 3002 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓[𝐵 / 𝑦]𝜓))
24 ralrnmpt.2 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
2524sbcieg 3030 . . . . . 6 (𝐵𝑉 → ([𝐵 / 𝑦]𝜓𝜒))
2625adantl 277 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([𝐵 / 𝑦]𝜓𝜒))
2723, 26bitrd 188 . . . 4 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓𝜒))
2827ralimiaa 2567 . . 3 (∀𝑥𝐴 𝐵𝑉 → ∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒))
29 pm5.32 453 . . . . . 6 ((𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)) ↔ ((𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ (𝑥𝐴𝜒)))
3029albii 1492 . . . . 5 (∀𝑥(𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)) ↔ ∀𝑥((𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ (𝑥𝐴𝜒)))
31 exbi 1626 . . . . 5 (∀𝑥((𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ (𝑥𝐴𝜒)) → (∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ ∃𝑥(𝑥𝐴𝜒)))
3230, 31sylbi 121 . . . 4 (∀𝑥(𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)) → (∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ ∃𝑥(𝑥𝐴𝜒)))
33 df-ral 2488 . . . 4 (∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒) ↔ ∀𝑥(𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)))
34 df-rex 2489 . . . . 5 (∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓))
35 df-rex 2489 . . . . 5 (∃𝑥𝐴 𝜒 ↔ ∃𝑥(𝑥𝐴𝜒))
3634, 35bibi12i 229 . . . 4 ((∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∃𝑥𝐴 𝜒) ↔ (∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ ∃𝑥(𝑥𝐴𝜒)))
3732, 33, 363imtr4i 201 . . 3 (∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒) → (∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∃𝑥𝐴 𝜒))
3828, 37syl 14 . 2 (∀𝑥𝐴 𝐵𝑉 → (∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∃𝑥𝐴 𝜒))
3921, 38bitrd 188 1 (∀𝑥𝐴 𝐵𝑉 → (∃𝑦 ∈ ran 𝐹𝜓 ↔ ∃𝑥𝐴 𝜒))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1370   = wceq 1372  wex 1514  wcel 2175  wral 2483  wrex 2484  [wsbc 2997  cmpt 4104  ran crn 4674   Fn wfn 5263  cfv 5268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-csb 3093  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4338  df-xp 4679  df-rel 4680  df-cnv 4681  df-co 4682  df-dm 4683  df-rn 4684  df-iota 5229  df-fun 5270  df-fn 5271  df-fv 5276
This theorem is referenced by:  txbas  14648
  Copyright terms: Public domain W3C validator