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

Theorem rexrnmpt 5842
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 5505 . . . 4 (∀𝑥𝐴 𝐵𝑉𝐹 Fn 𝐴)
3 dfsbcq 3053 . . . . 5 (𝑤 = (𝐹𝑧) → ([𝑤 / 𝑦]𝜓[(𝐹𝑧) / 𝑦]𝜓))
43rexrn 5836 . . . 4 (𝐹 Fn 𝐴 → (∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∃𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
52, 4syl 14 . . 3 (∀𝑥𝐴 𝐵𝑉 → (∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∃𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
6 nfv 1581 . . . . 5 𝑤𝜓
7 nfsbc1v 3070 . . . . 5 𝑦[𝑤 / 𝑦]𝜓
8 sbceq1a 3061 . . . . 5 (𝑦 = 𝑤 → (𝜓[𝑤 / 𝑦]𝜓))
96, 7, 8cbvrex 2783 . . . 4 (∃𝑦 ∈ ran 𝐹𝜓 ↔ ∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓)
109bicomi 132 . . 3 (∃𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∃𝑦 ∈ ran 𝐹𝜓)
11 nfmpt1 4219 . . . . . . 7 𝑥(𝑥𝐴𝐵)
121, 11nfcxfr 2389 . . . . . 6 𝑥𝐹
13 nfcv 2392 . . . . . 6 𝑥𝑧
1412, 13nffv 5700 . . . . 5 𝑥(𝐹𝑧)
15 nfv 1581 . . . . 5 𝑥𝜓
1614, 15nfsbc 3072 . . . 4 𝑥[(𝐹𝑧) / 𝑦]𝜓
17 nfv 1581 . . . 4 𝑧[(𝐹𝑥) / 𝑦]𝜓
18 fveq2 5690 . . . . 5 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
1918sbceq1d 3056 . . . 4 (𝑧 = 𝑥 → ([(𝐹𝑧) / 𝑦]𝜓[(𝐹𝑥) / 𝑦]𝜓))
2016, 17, 19cbvrex 2783 . . 3 (∃𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓 ↔ ∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓)
215, 10, 203bitr3g 222 . 2 (∀𝑥𝐴 𝐵𝑉 → (∃𝑦 ∈ ran 𝐹𝜓 ↔ ∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓))
221fvmpt2 5783 . . . . . 6 ((𝑥𝐴𝐵𝑉) → (𝐹𝑥) = 𝐵)
2322sbceq1d 3056 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓[𝐵 / 𝑦]𝜓))
24 ralrnmpt.2 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
2524sbcieg 3084 . . . . . 6 (𝐵𝑉 → ([𝐵 / 𝑦]𝜓𝜒))
2625adantl 277 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([𝐵 / 𝑦]𝜓𝜒))
2723, 26bitrd 188 . . . 4 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓𝜒))
2827ralimiaa 2612 . . 3 (∀𝑥𝐴 𝐵𝑉 → ∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒))
29 pm5.32 457 . . . . . 6 ((𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)) ↔ ((𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ (𝑥𝐴𝜒)))
3029albii 1523 . . . . 5 (∀𝑥(𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)) ↔ ∀𝑥((𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ (𝑥𝐴𝜒)))
31 exbi 1657 . . . . 5 (∀𝑥((𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ (𝑥𝐴𝜒)) → (∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ ∃𝑥(𝑥𝐴𝜒)))
3230, 31sylbi 121 . . . 4 (∀𝑥(𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)) → (∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓) ↔ ∃𝑥(𝑥𝐴𝜒)))
33 df-ral 2533 . . . 4 (∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒) ↔ ∀𝑥(𝑥𝐴 → ([(𝐹𝑥) / 𝑦]𝜓𝜒)))
34 df-rex 2534 . . . . 5 (∃𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∃𝑥(𝑥𝐴[(𝐹𝑥) / 𝑦]𝜓))
35 df-rex 2534 . . . . 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 1400   = wceq 1402  wex 1545  wcel 2209  wral 2528  wrex 2529  [wsbc 3051  cmpt 4187  ran crn 4770   Fn wfn 5367  cfv 5372
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380
This theorem is referenced by:  txbas  15282
  Copyright terms: Public domain W3C validator