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

Theorem ralrnmpt 5341
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
ralrnmpt (∀𝑥𝐴 𝐵𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥𝐴 𝜒))
Distinct variable groups:   𝑥,𝐴   𝑦,𝐵   𝜒,𝑦   𝑦,𝐹   𝜓,𝑥
Allowed substitution hints:   𝜓(𝑦)   𝜒(𝑥)   𝐴(𝑦)   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem ralrnmpt
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ralrnmpt.1 . . . . 5 𝐹 = (𝑥𝐴𝐵)
21fnmpt 5056 . . . 4 (∀𝑥𝐴 𝐵𝑉𝐹 Fn 𝐴)
3 dfsbcq 2818 . . . . 5 (𝑤 = (𝐹𝑧) → ([𝑤 / 𝑦]𝜓[(𝐹𝑧) / 𝑦]𝜓))
43ralrn 5337 . . . 4 (𝐹 Fn 𝐴 → (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
52, 4syl 14 . . 3 (∀𝑥𝐴 𝐵𝑉 → (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓))
6 nfv 1462 . . . . 5 𝑤𝜓
7 nfsbc1v 2834 . . . . 5 𝑦[𝑤 / 𝑦]𝜓
8 sbceq1a 2825 . . . . 5 (𝑦 = 𝑤 → (𝜓[𝑤 / 𝑦]𝜓))
96, 7, 8cbvral 2574 . . . 4 (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓)
109bicomi 130 . . 3 (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑦 ∈ ran 𝐹𝜓)
11 nfmpt1 3879 . . . . . . 7 𝑥(𝑥𝐴𝐵)
121, 11nfcxfr 2217 . . . . . 6 𝑥𝐹
13 nfcv 2220 . . . . . 6 𝑥𝑧
1412, 13nffv 5216 . . . . 5 𝑥(𝐹𝑧)
15 nfv 1462 . . . . 5 𝑥𝜓
1614, 15nfsbc 2836 . . . 4 𝑥[(𝐹𝑧) / 𝑦]𝜓
17 nfv 1462 . . . 4 𝑧[(𝐹𝑥) / 𝑦]𝜓
18 fveq2 5209 . . . . 5 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
19 dfsbcq 2818 . . . . 5 ((𝐹𝑧) = (𝐹𝑥) → ([(𝐹𝑧) / 𝑦]𝜓[(𝐹𝑥) / 𝑦]𝜓))
2018, 19syl 14 . . . 4 (𝑧 = 𝑥 → ([(𝐹𝑧) / 𝑦]𝜓[(𝐹𝑥) / 𝑦]𝜓))
2116, 17, 20cbvral 2574 . . 3 (∀𝑧𝐴 [(𝐹𝑧) / 𝑦]𝜓 ↔ ∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓)
225, 10, 213bitr3g 220 . 2 (∀𝑥𝐴 𝐵𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓))
231fvmpt2 5286 . . . . . 6 ((𝑥𝐴𝐵𝑉) → (𝐹𝑥) = 𝐵)
24 dfsbcq 2818 . . . . . 6 ((𝐹𝑥) = 𝐵 → ([(𝐹𝑥) / 𝑦]𝜓[𝐵 / 𝑦]𝜓))
2523, 24syl 14 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓[𝐵 / 𝑦]𝜓))
26 ralrnmpt.2 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
2726sbcieg 2847 . . . . . 6 (𝐵𝑉 → ([𝐵 / 𝑦]𝜓𝜒))
2827adantl 271 . . . . 5 ((𝑥𝐴𝐵𝑉) → ([𝐵 / 𝑦]𝜓𝜒))
2925, 28bitrd 186 . . . 4 ((𝑥𝐴𝐵𝑉) → ([(𝐹𝑥) / 𝑦]𝜓𝜒))
3029ralimiaa 2426 . . 3 (∀𝑥𝐴 𝐵𝑉 → ∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒))
31 ralbi 2490 . . 3 (∀𝑥𝐴 ([(𝐹𝑥) / 𝑦]𝜓𝜒) → (∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∀𝑥𝐴 𝜒))
3230, 31syl 14 . 2 (∀𝑥𝐴 𝐵𝑉 → (∀𝑥𝐴 [(𝐹𝑥) / 𝑦]𝜓 ↔ ∀𝑥𝐴 𝜒))
3322, 32bitrd 186 1 (∀𝑥𝐴 𝐵𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥𝐴 𝜒))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1285  wcel 1434  wral 2349  [wsbc 2816  cmpt 3847  ran crn 4372   Fn wfn 4927  cfv 4932
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-pow 3956  ax-pr 3972
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-v 2604  df-sbc 2817  df-csb 2910  df-un 2978  df-in 2980  df-ss 2987  df-pw 3392  df-sn 3412  df-pr 3413  df-op 3415  df-uni 3610  df-br 3794  df-opab 3848  df-mpt 3849  df-id 4056  df-xp 4377  df-rel 4378  df-cnv 4379  df-co 4380  df-dm 4381  df-rn 4382  df-iota 4897  df-fun 4934  df-fn 4935  df-fv 4940
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator