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

Theorem iseqf1olemqf1o 10921
Description: Lemma for seq3f1o 10932. 𝑄 is a permutation of (𝑀...𝑁). 𝑄 is formed from the constant portion of 𝐽, followed by the single element 𝐾 (at position 𝐾), followed by the rest of J (with the 𝐾 deleted and the elements before 𝐾 moved one position later to fill the gap). (Contributed by Jim Kingdon, 21-Aug-2022.)
Hypotheses
Ref Expression
iseqf1olemqf.k (𝜑𝐾 ∈ (𝑀...𝑁))
iseqf1olemqf.j (𝜑𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
iseqf1olemqf.q 𝑄 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))
Assertion
Ref Expression
iseqf1olemqf1o (𝜑𝑄:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
Distinct variable groups:   𝑢,𝐽   𝑢,𝐾   𝑢,𝑀   𝑢,𝑁   𝜑,𝑢
Allowed substitution hint:   𝑄(𝑢)

Proof of Theorem iseqf1olemqf1o
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 iseqf1olemqf.k . . . 4 (𝜑𝐾 ∈ (𝑀...𝑁))
2 iseqf1olemqf.j . . . 4 (𝜑𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
3 iseqf1olemqf.q . . . 4 𝑄 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))
41, 2, 3iseqf1olemqf 10919 . . 3 (𝜑𝑄:(𝑀...𝑁)⟶(𝑀...𝑁))
51ad2antrr 492 . . . . . 6 (((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) ∧ (𝑄𝑣) = (𝑄𝑤)) → 𝐾 ∈ (𝑀...𝑁))
62ad2antrr 492 . . . . . 6 (((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) ∧ (𝑄𝑣) = (𝑄𝑤)) → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
7 simplrl 541 . . . . . 6 (((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) ∧ (𝑄𝑣) = (𝑄𝑤)) → 𝑣 ∈ (𝑀...𝑁))
8 simplrr 542 . . . . . 6 (((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) ∧ (𝑄𝑣) = (𝑄𝑤)) → 𝑤 ∈ (𝑀...𝑁))
9 simpr 110 . . . . . 6 (((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) ∧ (𝑄𝑣) = (𝑄𝑤)) → (𝑄𝑣) = (𝑄𝑤))
105, 6, 3, 7, 8, 9iseqf1olemmo 10920 . . . . 5 (((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) ∧ (𝑄𝑣) = (𝑄𝑤)) → 𝑣 = 𝑤)
1110ex 115 . . . 4 ((𝜑 ∧ (𝑣 ∈ (𝑀...𝑁) ∧ 𝑤 ∈ (𝑀...𝑁))) → ((𝑄𝑣) = (𝑄𝑤) → 𝑣 = 𝑤))
1211ralrimivva 2632 . . 3 (𝜑 → ∀𝑣 ∈ (𝑀...𝑁)∀𝑤 ∈ (𝑀...𝑁)((𝑄𝑣) = (𝑄𝑤) → 𝑣 = 𝑤))
13 dff13 5964 . . 3 (𝑄:(𝑀...𝑁)–1-1→(𝑀...𝑁) ↔ (𝑄:(𝑀...𝑁)⟶(𝑀...𝑁) ∧ ∀𝑣 ∈ (𝑀...𝑁)∀𝑤 ∈ (𝑀...𝑁)((𝑄𝑣) = (𝑄𝑤) → 𝑣 = 𝑤)))
144, 12, 13sylanbrc 421 . 2 (𝜑𝑄:(𝑀...𝑁)–1-1→(𝑀...𝑁))
15 elfzel1 10406 . . . . . 6 (𝐾 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
161, 15syl 14 . . . . 5 (𝜑𝑀 ∈ ℤ)
17 elfzel2 10405 . . . . . 6 (𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ)
181, 17syl 14 . . . . 5 (𝜑𝑁 ∈ ℤ)
1916, 18fzfigd 10846 . . . 4 (𝜑 → (𝑀...𝑁) ∈ Fin)
20 enrefg 7040 . . . 4 ((𝑀...𝑁) ∈ Fin → (𝑀...𝑁) ≈ (𝑀...𝑁))
2119, 20syl 14 . . 3 (𝜑 → (𝑀...𝑁) ≈ (𝑀...𝑁))
22 f1finf1o 7254 . . 3 (((𝑀...𝑁) ≈ (𝑀...𝑁) ∧ (𝑀...𝑁) ∈ Fin) → (𝑄:(𝑀...𝑁)–1-1→(𝑀...𝑁) ↔ 𝑄:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
2321, 19, 22syl2anc 415 . 2 (𝜑 → (𝑄:(𝑀...𝑁)–1-1→(𝑀...𝑁) ↔ 𝑄:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
2414, 23mpbid 147 1 (𝜑𝑄:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  wral 2528  ifcif 3635   class class class wbr 4125  cmpt 4187  ccnv 4768  wf 5368  1-1wf1 5369  1-1-ontowf1o 5371  cfv 5372  (class class class)co 6075  cen 7010  Fincfn 7012  1c1 8170  cmin 8487  cz 9623  ...cfz 10390
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-in1 623  ax-in2 624  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-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-er 6797  df-en 7013  df-fin 7015  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391
This theorem is referenced by:  seq3f1olemqsumkj  10926  seq3f1olemqsumk  10927  seq3f1olemstep  10929
  Copyright terms: Public domain W3C validator